2 Knapsack problems (see also Cormen at al.) The 0-1 knapsack problem is the following: a thief robbing a store finds n items. The ith item is worth vi dollars and weighs wi kilos with i and wi positive integers. The thief wants to take as valuable a load as possible, but he can carry at most W kilos in his knapsack with w