Consider the instance of discrete knapsack problem with the knapsack capacity $800$ and the

item information as follows:

Item Weight Value

$1600$ $$36,000$

$2400$ $$23,200$

$3400$ $$23,200$

$4160$ $$7200$

Find the most valuable subset of the items that fits into the knapsack using Greedy Approach.

Examine your solution carefully to check whether your solution is optimal and explain the

reason of your finding.