Exercise 4 [8-2 marks] A. One greedy strategy to solve the knapsack problem is to consider the items in order of decreasing values of "/s , where Vi and Si are the value and the size of item . For each item, add it to the knapsack if it fits otherwise ignore it and move to the next item in the ordered list. Write a complete pseudocode for this strategy. The pseudocode should print the details of the solution (selected items, their total value and size). Answer here: B. Show that this strategy does not necessarily yield optimal solutions. Take the example of exercise 1 and change the knapsack capacity to 15 (The value of the optimal solution is 54). Answer here