Can you please explain what’s going on? Thank you!
VI. (16 points) Consider the following items in the Knapsack Problem weight value Knapsack capacity w 11. Item S30 $18 $12 $15 4 2 4 Using the same items the Dynamic Programming approach outlined in the book and discussed in class produces a (n +1)x(W+1) table containing the maximum values PDw for a knapsack of capacity w, considering the first i items. 1 2 3 4 5
OR
OR