What is the time complexity of the naive recursive Fibonacci solution?

Question

Accepted Answer

(C) O(2^n). Explanation: Without memoization, each call branches into two, leading to exponential O(2^n) calls.