knapsack problem using Dynamic programming