Suppose we are given four scientific instruments {11, 12, 13, and a space capsule whose payload weight cannot exceed C12. For each instrument I, let v, and w, denote its scientific value and its weight, respectively: v - [2 3 6 9] and w - [2 4 5 8]'. We need to determine which instruments to load into the capsule, so that their total value is maximized, provided that their total weight does not exceed C-12. C, x ? B4}, where {O, 1} indicates whether the corresponding instrument 1, This is an instance of the 0-1 knapsack problem: max(vx 1 wx each decision variable x, is selected or not. Solve the 0-1_knapsack_problem using dynamic programming