Exercise 3.27 in your textbook (here "stack space" means the "space on the runtime stack" the stack that stores function calls and local variables).

If the recursive routine in Section 2.4 used to compute Fibonacci numbers is run

for N = 50, is stack space likely to run out? Why or why not?