Try this exercise. Fill in the missing part by typing it in.

The 0/1 knapsack problem is a classic ____ problem that involves selecting the most valuable items while staying within the weight limit of the knapsack. In this problem, we can only take each item once (0 or 1) and the goal is to maximize the total value of the items.