3. Read the Discrete Knapsack Problem in the handout on Dynamic Programming. A thief wishes to steal n objects having values vi > 0 and weights Wi > 0 (for 1 sis n). His knapsack, which will carry the stolen goods, holds at most a total weight W > 0. Let Xi = 1 if object i is to be taken, and Xi = 0 if object i is not taken (1 Sisn). The thief's goal is to maximize the total value x1=1 XiVi of the goods stolen, subject to the constraint X1=1 XiW;