The $0/1$ Knapsack problem is suitable for a greedy approach because it requires each item to be taken in whole or not at all, perfectly aligning with the principle of making the locally optimal choice at each step.

Group of answer choices

False

True