Which of the following statements about recursive functions are true?

Choose as many as are correct

$1$

If the recursion depth is too large, we might risk running out of stack memory and crashing with no recovery mechanism.

$2$

If the recursion depth is too large, we might get an incorrect result, as all automatically terminate the function call when the stack is full.

$3$

Every recursive algoritmm can be rewritten using loops and additional data structures like a stack without any recursive calls

$4$

Recuriton is a fundamentally more powerful computing concept, and some algorithins can only be inapleminted recursively