The 0-1 knapsack problem. Given six items {(vi , wi)} for i = 1, 2, . . . , 6 as follows: i vi wi 1 40 100 2 35 50 3 18 45 4 4 20 5 10 10 6 2 5 and the total weight W = 100, where vi and wi are the value and weight of item i, respectively. Find the greedy solutions by using following strategies: 1 (a) Greedy by value, i. e., at each step select from the remaining items the one with the highest value (b) Greedy by weight, i. e., at each step select from the remaining items the one with the least weight. (c) Greedy by value density, i. e.,