2 marks] (b) Describe precisely the standard dynamic programming solution in terms of recurrence to sub- [3 marks] (c) Illustrate the solution to an input with knapsack with capacity W = 5 and elements, as pairs of weight and values, (2,3), (3,4), (4,5), (5,6). You should have a table with 4 x 6 subproblems. [2 marks] (d) State formally the Fractional Knapsack Problem and apply its greedy algorithm to the input of [3 marks] 4. (a) State formally the 0/1 Knapsack Problem, as described in class. problems part (c)