Problem
1. Write a recursive definition of n! = 1 × 2 × . . . × n, similar to the recursive definition of the Fibonacci numbers.
2. Find out how often the recursive version of fib calls itself. Keep a static variable fib Count and increment it once in every call to fib. What is the relationship between fib(n) and fib Count?