Can you explain the 0-1 Knapsack problem and its solution?

Question Explain

The 0-1 Knapsack problem involves selecting items with given weights and values to maximize total value without exceeding a weight capacity.