For Knapsack use dynamic programming to fill a knapsack without repetition having a weight capacity of 10 units with a load of maximum value from the following set of objects: Weights: 1, 2, 5, 6, and 7 units Values: 1, 7, 11, 21, and 31, respectively. Your answer should include: a table with solutions to sub-problems the value of the optimal load the objects to be included in the optimal load (keep back-pointers in the table if you want)