Exercise 3 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,...

pls solve part a

Extracted text: Exercise 3 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. 0sjsC=13 0 1234 5 6 78 9 10 11 12 13 0 0000 000000 0000 V=10, S;=2 |10 V=5, S;=3|20 V;=15, S;=5| 30 0