The Fibonacci function exhibits exponential time complexity due to the repeated recursive calls and redundant computations. For fib(n), it makes two recursive calls: fib(n-1) and fib(n-2). Each of these recursive calls further makes two more calls until it reaches the base cases (n <= 1).