Plan from the supplied facts
Fictional optional features are independent and indivisible: A costs 6 hours for 7 points, B costs 4 for 5, C costs 3 for 4. The limit is 7 hours and points add. Enumerate subsets; fractions of a feature produce no points under this model.
| Subset | Hours | Points | Fits 7 h |
|---|---|---|---|
| A | 6 | 7 | Yes |
| B + C | 7 | 9 | Yes |
| A + C | 9 | 11 | No |
Work through the choice
The empty set, B and C alone are also feasible but score less than B+C. A+B and all three exceed the limit. A simple highest-single-score rule misses the better subset.
Which subset maximises supplied points at seven hours?
Show the worked answer
B+C: 4+3=7 hours and 5+4=9 points. No fractional A is used.
Material to use in your plan
List every candidate subset with additive effort, benefit and feasibility. Add dependency or exclusivity constraints before enumeration when features are not independent.