Write down a recursive definition of the Fibonacci numbers. The Fibonacci numbers are the sequence of integers, each of which is the sum of the previous two numbers. The first two numbers in the sequence are 0 and 1. Explain why you would not normally use recursion to solve this problem.
Write a recursive method to implement it.