x = 6, y = 9, z = 5, a = 9, b = 11, c = 8

Q.2. (50 puts.) Given the following knapsack information: Item 1 Item 2 Item 3 Item 4 Items Kuapsack Capacity 2 kg 2 kg 2 kg 2 kg 6 kg $(100-a) $(150+) S(30-c) $ $100 $160 a) Use dvzamic programming method and solve 0-1 Koapsack problem given above. b) Use greedy programming method and solve Fractional Knapsack problem given above