A. Apply the dynamic programming algorithm discussed in Chapter 7 to fill the given table for a knapsack instance of 7 items having values 10, 5, 15, 7, 6, 18, 3 and sizes 2, 3, 5, 7, 1, 4, 1. The knapsack capacity is C = 13. The first row and the first column are already filled. The value of the optimal solution is also given. 12 13 . . 0 0 07 52 B. A way to find the items forming an optimal solution is to sort the items in decreasing order according to where Vi and S are the value and the size of item i. If there is a sequence of successive items starting from the item 1 where their total size is equal to C (The knapsack capacity), then they form an optimal solution. Use this method to find and optimal solution (indicate its items, total value and total size)