Instructions

Complete the two Parsons problems for factorial below and indicate that you have completed them on the Gradescope worksheet.

Recall the recursive implementation of Fibonacci:

fib( n )

   if n == 0 or n == 1

      return 1

   else

      return fib( n-1 ) + fib( n-2 )