Knapsack problem.

Question 2 [10 marks]: Consider the instance of discrete knapsack problem with the knapsack capacity 40 and the item information as follows: Item A B D Weight 30 20 20 8 Value $1800 $1160 $1160 $360 Find the most valuable subset of the items that fits into the knapsack using Greedy Approach. Is the resulting solution the optimal solution? Verify informally and give the reason to justify of your