**Dynamic Programming Approach:** We'll use a 2D list `dp` …
**Dynamic Programming Approach:**
We'll use a 2D list `dp` where `dp[i][w]` represents the maximum value that can be achieved with the first `i` items and a maximum weight capacity `w`.
**Dynamic Programming Approach:**
We'll use a 2D list `dp` where `dp[i][w]` represents the maximum value that can be achieved with the first `i` items and a maximum weight capacity `w`.