What is the space complexity of a recursive Fibonacci function without memoisation?

Question

Accepted Answer

(B) O(n). Explanation: The recursion depth goes up to n, so the call stack uses O(n) space.