Analyze the time complexity of the naive recursive Fibonacci implementation.

public int fibonacci(int n) {
    if (n <= 1) return n;
    return fibonacci(n-1) + fibonacci(n-2);
}