Crowdly
Add to Chrome
Recall the unbounded knapsack dynamic programming problem you have learnt from y...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Recall the unbounded knapsack dynamic programming problem you have learnt from your lecture, with the following recurrence relation:
Image failed to load
You have run the algorithm on the following items:
| Item | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| Weight | 9 | 5 | 6 | 2 | 3 |
| Value | 550 | 350 | 180 | 90 | 40 |
| Capacity | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| MaxValue | 0 | 0 | 90 | 90 | 180 | 350 | 350 | 440 | 440 | 550 | 700 | 700 | 790 | 790 |
| Decision | None | None | 4 | 4 | 4 | 2 | 2 | 2 | 2 | 1 | 2 | 2 | 2 | 2 |