Apply the 01 knapsack algorithm to the following data Maximu
     Apply the 0-1 knapsack algorithm to the following data. Maximum weight is 50.  Show the complete grid that gives the maximum possible value that can be carried by the knapsack  Provide the items that make the maximum value    
 
  
  Solution
b) Items 2 and 3 make the maximum value.
100+120=220
| 0 | 10 | 20 | 30 | 40 | 50 | |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 
| 1 | 0 | 60 | 60 | 60 | 60 | 60 | 
| 2 | 0 | 60 | 100 | 160 | 160 | 160 | 
| 3 | 0 | 60 | 100 | 160 | 180 | 220 | 

