Which statement about recursive algorithms is true?
Recursive algorithms always use more memory than iterative ones.
Tail recursion can be optimized by compilers into a loop.
Every recursive algorithm must be solved using dynamic programming to be efficient.
Recursion can only be used for problems with optimal substructure.