Question: Which of the following statements about dynamic programming is correct?

A) Dynamic programming is only applicable to optimization problems and cannot be used for counting problems.
B) Dynamic programming always guarantees a polynomial time solution for all types of problems.
C) Dynamic programming solves problems by breaking them down into overlapping subproblems and solving each subproblem just once.
D) The main advantage of dynamic programming is that it eliminates the need for recursion entirely.