Q4 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the iteminformation as follows:

Find the most valuable subset of the items that fits into the knapsack using Greedy Approach with all the detailed steps shown.