Take the following function:

int Fib(int n)

{

if (a <= 1) return a;

return Fib(a-1) + Fib(a-2);

}

Answer the following:

a. What makes this function recursive?

b. What is the base case for this function ?

c. What is the recursive case for this function?

d. Is this function considered an efficient function? Consider how many calls to Fib() are made by the recursive case.