a) Why Knapsack Problem described above is called 0/1 Knapsack Problem.
b) Draw the Dynamic Programming Tables (one for computing optimal value and one for keeping track of items used in getting optimal value) for the 0/1 Knapsack Problem given below and show your final result.
Item i Weight
Value
1 3 3
2 2 7
3 5 2
4 7 6
5 4 4
The maximum weight that knapsack can carry is, W = 10