How do you solve the 0/1 Knapsack Problem using dynamic programming?

Question Explain

This problem asks to maximize value given weight constraints where items cannot be split. It tests classic DP table filling.