In dynamic programming, what is a common strategy used for solving optimization problems?

Breaking down a problem into smaller, overlapping subproblems and solving each once.

Solving the problem using a depth$-$first search approach.

Using a greedy approach to make locally optimal choices.

Solving the problem as a whole without breaking it down.

Randomly generating potential solutions and selecting the best one.