Recursion Practice Test

For factorial(5) below, how many recursive calls are made before the base case returns?

int factorial(int n) {

  if (n <= 1) return 1;      // base case

  return n * factorial(n-1); // recursive case

}

```​

What is the output of the recursive function for input $n = 6$ in the Fibonacci code?

int fib(int n) {

  if (n <= 1) return n;          // base cases

  return fib(n-1) + fib(n-2);    // recursive case

}

```​