Given the following 0/1 Knapsack instance with: M = 8, n = 4 and P= = {2,5, 4, 10}, and W {2,6, 1,3}. a) Compute all subproblems V[i, t] defined in class for i = 0,1,. ...,n and t = 0,1, , M by filling in the memo table. = b) Give the maximum profit for the instance. c) Show the set of items to put in the knapsack by back-tracing the dynamic programing table. You only need to provide one solution.