Consider the recursive version of the fib method from the book. How many recursive calls to fib(2) will be made from the original call of  fib(6)?

public static long fib(int n)

{

   if (n <= 2) return 1;

   else return fib(n – 1) + fib(n – 2);

}