In the dynamic programming solution of Knapsack problem, consider the array A where Ali,v]=min size among subsets of the first i items with total value v. Let B be the size of the knapsack. Briefly...

Extracted text: In the dynamic programming solution of Knapsack problem, consider the array A where Ali,v]=min size among subsets of the first i items with total value v. Let B be the size of the knapsack. Briefly explain How to use that Array to obtain the optimal solution, i.e., the items in the optimal packing, and not only ?the value of the optimal packing OPT