What are the big oh's for both of these methods(iterative and recursive fibonacci)?

//Recursive

public static long fib(long index) {

if (index == 0) // Base case

return 0;

else if (index == 1) // Base case

return 1;

else // Reduction and recursive calls

return fib(index - 1) + fib(index - 2);

}

//Iterative

public static long fib(long n) {

long f0 = 0; // For fib(0)

long f1 = 1; // For fib(1)

long f2 = 1; // For fib(2)

if (n == 0)

return f0;

else if (n == 1)

return f1;

else if (n == 2)

return f2;

for (int i = 3; i <= n; i++) {

f0 = f1;

f1 = f2;

f2 = f0 + f1;

}

return f2;

}