結果 : wap to implement 0 1 knapsack problem using dynamic programming