Assume you are given four objects, and you should fit as many of them into a knapsack of size 15 as possible. The resulting value of the objects should be as large as possible.

With complete explanation

1.Please select your objects using the Greedy principle according to some greedy criterion you may choose yourself (please make clear which criterion youve used). Is this solution optimal? 2. Please explain and apply the principle of dynamic programming using the example above.

19 7 kg 4 15 kg 8 16 kg 3 be 1 N