What is the time complexity in Big-O notation for the fib method in the FibonacciCalculator class shown below?

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