結果 : time and space complexity of 0 1 knapsack problem using dynamic programming