0/1 Knapsack (Carry Bag)Problem:
Knapsack Problem is that,
• We have to fill a bag that can carry maximum weight W
• We have to fill the bag with different items each having acertain weight and
• We want to fill the bag with these items such that totalvalue of items present in
bag is maximum and total weight of items doesn’t increasemaximum weight that
bag can carry(W).
a) Why Knapsack Problem described above is called 0/1 Knapsack
b) Draw the Dynamic Programming Tables (one for computingoptimal
value and one for keeping track of items used in getting optimalvalue) for
the 0/1 Knapsack Problem given below and show your finalresult.
The maximum weight that knapsack can carry is, W = 10