Apply the dynamic programming and Branch and Bound algorithms to the following instance of the knapsack problem. Consider the Knapsack instance item=5, (W1,W2,W3,W4,W5)=(2,3,1,2,2), (V1,V2,V3,V4,V5)=($10,$50,$30,$40,$70) and W=6.

{DESIGN AND ALGORITHM}