(10 pts.) Greedy choice Recall that in the 0-1 knapsack problem, you are given a backpack with capacity W. There are n items and the i-th item has weight w; and value v;. The goal is to pick some items with total weight at most W that maximize the total value. More formally, you need to find an assignment (*1 , . . . ,xn) with x; {0,1} (i.e., x; is either () or 1), where x; = 1 means the i-th item is picked and x; = 0) otherwise. The goal is to maximize ?=1XV; subject to the constraint 21 x;w;