Fibonacci Sequence using Recursive Algorithm

How Many Terms?

Sequence:

THE ALGORITHM:

function fib(n) {

if ((n == 0) || ( n == 1)) {
  return(n);
  }
else {
  return(fib(n - 1) + fib(n - 2));
  }
}