2. (10 points) Knapsack Problem. (a) (5 points) Given the following recurrence for solving the Knapsack Problem: V[i, j] = - - max{V[i 1, j], vi + V[i 1, j wi]}, j wi 0 V[i 1, j], j- wi < 0 create a dynamic programming table for the following instance of the Knapsack Problem with capacity W = 4. Item Weight Value 1 3 $25 2 2 $20 3 1 $15 Be sure to show all of your work. (b) (5 points) Write a pseudo-code algorithm that determines the contents of the knap- sack from the table generated by the recurrence relationship above.