To get some practice with recursion.
You can do all this in one driver program.
Write a recursive method to compute the result of the Fibonaccisequence:
Fibonacci(N) = Fibonacci(N -1) +Fibonacci(N-2)
N == 0 is 0
N == 1 is 1
Testing: Display the result for Fibonacci(N)and the number of function calls for N = 2, 5 and 10.
