Determine the time complexity of the naive recursive Fibonacci function shown above.

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