Java how does dynamic programming make an inefficient recursive algorithm more efficient?

by keeping track of previously computed recursive calls, and using the stored values when possible instead of initiating redundant recursive calls.

by using arrays, which are inherently more efficient than recursion.

by dynamically changing the order in which multiple recursive calls are performed, thereby eliminating redundant recursive calls.

by replacing the recursion with iteration, which is inherently more efficient.