
2 al) (45 points) Fill in the capacity of the knapsack is 6, and the item weights and values are as follows: Item weights w (2.3,4) tem valuesv [4,7, 1 boxes to complete the dynamic programming algorithm for knapsack, where the 2 0 0 3 5 b) What is the optimal weight? c) What is the optimal set of items?