Integer Knapsack – A knapsack has max capacity C and there are n items each with weight w[i] and value v[i]. Maximize the value in the knapsack without exceeding its max capacity