Consider the following items in the Knapsack Problem Item Knapsack capacity W 11. $30 $18 $12 $15 the same items the Dynamic Programming approach outined in the book and discussed in class produces a (n+1)x(W+ 1) tablo containing the maxinum values PLOP for a knapsack of capacity w 10 1o 0 0 0 0 30 30 30 30 30 3030 2 0 00 0 18 30 30 30 30 434 48 s o o 0 12 18 30 303024 4 0 0 0 12 18 30 30 30 Compute the missing values in this table. P4118) P[4119]- PI4110] P(41[11]