結果 : explain 0 1 knapsack problem by using dynamic programming with an examples