Answer question 1b only

imal, or transform y into a and thus show that a too is optimal XERCISES I. (a) Find an optimal solution to the knapsack instance n 7, m ms are eytuo se, repeated use of the above arg = 15, (pi, P2,. . . ,P7) = (10, 5, 15, 7, 6, 18, 3) , and (w1 , u2. . . . , (b) Let F() be the value of the solution generated on problem in- stance I by GreedyKnapsack when the objects are input in non- increasing order of the pi's. Let F*(I) be the value of an optimal solution for this instance. How large can the ratio F(I) FU (e) Answer (b) for the case i order of the wi's. n which the input is in nondecreasing . (0/1 Knapsack] Consider the knapsack problem discussed in this se tion. We add the requirement that ai = 1 or xi = 0, 1 { i n; the is an object is either included or not included into the knapsack wish to solve the