1. We have 5 objects, and the weights and values are

No. 1 2 3 4 5

w 10 20 30 40 50

v 20 30 66 60 55

The knapsack can carry a weight not exceeding 90, find a subset items and give the total weight and value for following algorithms:

1) By using the algorithm of greedy of value for 0-1 knapsack problem? By selecting the highest value first.

2) By using the algorithm of greedy of weight for 0-1 knapsack problem? By selecting lightest item first.

3) By using the algorithm of greedy of density for 0-1 knapsack problem? By selecting the highest density item first.

4) By using the algorithm of greedy of density for fractional knapsack problem? By selecting the highest density item first.

**Subject Computer Science Data Structures and Algorithms**