write two programs, one for fibonacci numbers and one for factorial.

Write a recursive definition of the fibonacci numbers, a sequence of integers, each of which is the sum of the previous two numbers. The first two numbers in the series are 0 and 1.

Write a recursive method that returns the value of N! (N factorial). Explain why you would normally not use recursion to solve this problem.