3. 20 points] Here's a variant of the knapsack problem: You are given a knapsack of capacity W, and an unlimited supply of each of n kinds of item, where the i-th kind of item has integer weight wi > 0 and value vi > 0, i