9. Using Dynamic Programming solve the below instance of knapsack problem. Capacity W=5
| Item | Weight | Value |
| 1 | 2 | 12 |
| 2 | 1 | 10 |
| 3 | 3 | 20 |
| 4 | 2 | 15 |
Answer:
Using Dynamic Programming solve the below instance of knapsack problem. Capacity W=5
9. Using Dynamic Programming solve the below instance of knapsack problem. Capacity W=5
| Item | Weight | Value |
| 1 | 2 | 12 |
| 2 | 1 | 10 |
| 3 | 3 | 20 |
| 4 | 2 | 15 |
Answer: