Consid the following Knapsack Problemi This problem can be sowen... Iynamic programming approach. For this, we used the recursive relation above to construct the following table f. w1=2,v1=12w2=1,v3=20w3=3,v3=20w4=3,v4=15 i) Compute (a) and (b) in the table above (show procedures, like a=max(,)=). ii) Find optimal value in the Knapsack, using the table above. iii) Using backtracking method, determine which items should be picked to get the optimal value in the Knapsack (show procedures)