Implement in Java the knapsack algorithm and run it twice against the set of items shown below, once with W = 10 and once with W = 11. (W is the constraint on total weight.) The program should output the content of the memoization table M[0..n][0..W] each time a row is filled. Additionally, the program should output the items included in the optimal set and the resulting maximum total value of the items included.

Item Value Weight W 10 I 11 3 18 5 4 22 6