What is the critical difference between the greedy technique and dynamic programming?

A$.$ Greedy technique uses a top$-$down approach, while dynamic programming uses a bottom$-$up approach

B$.$ Greedy technique solves problems recursively, while dynamic programming solves them iteratively

C$.$ The greedy technique finds the optimal solution at each step, while dynamic programming stores and reuses solutions to subproblems

D$.$ Greedy technique is faster than dynamic programming for all types of problems