7. Assume that we have a knapsack with max weight capacity W = 15. Our objective is to fill the knapsack with items such that the benefit (value or profit) is maximum. Following table contains the items along with their value and weight. Create a value table and calculate the Maximum benefit you can have using 0-1 Knapsack Algorithm. B C D E item A F G H. Weight 5 4 3 4 price 8. 13 5 10 15 20 27 3. 2. 2. LO 2.