### Implement the 0/1 Knapsack problem using bottom-up dynamic programming.
Implement the 0/1 Knapsack problem using bottom-up dynamic programming.