What is the main characteristic of a dynamic programming algorithm?

a$)$ It divides the problem into smaller subproblems

b$)$ It solves problems by trial and error

c$)$ It optimizes the solution by storing solutions to subproblems

d$)$ It uses recursive calls extensively