x:1 :y:9 z:4

a=x+3

b=y+2

c=z+3

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