a) Why Knapsack Problem explained as 0/1 Knapsack Problem.
b) Skecth Dynamic Programming Tables (one for calculating optimal value and one for keeping track of items used in getting optimal value) for 0/1 Knapsack Problem given below and illustrate your final result.
Item i Weight
Value
1 3 3
2 2 7
3 5 2
4 7 6
5 4 4
Maximum weight that knapsack can carry is, W = 10