Answer Q7. I already know the answer to Q6 is A. I want to understand how to derive the answer for Q7.

[4 marks] Solve the following instance of the fractional knapsack problem. The maximum allowable total weight is Wmax=11. Then, the following is true about the greedy algorithm to optimally solve this problem: A. The greedy algorithm considers the items in the following order: e,c,a,b,d. B. The greedy algorithm considers the items in the following order: d,b,a,c,e. C. The greedy algorithm considers the items in the following order: e,c,d,b,a. D. The greedy algorithm considers the items in the following order: d,b,a,c,e. E. The greedy algorithm considers the items in the following order: a,b,c,d,e. 7. [4 marks] Given the correct order of the greedy algorithm from Question 6: A. The greedy algorithm completely includes into the final solution items d,b,a and only 1/3 fraction of c and the total benefit of the solution is 27. B. The greedy algorithm completely includes into the final solution items e,c,a and only 3/5 fraction of b and the total benefit of the solution is 36 . C. The greedy algorithm completely includes into the final solution items e,c,a and only 2/5 fraction of b and the total benefit of the solution is 34 . D. The greedy algorithm completely includes into the final solution items d,b,a and the total benefit of the solution is 23