The Fibonacci Sequence:

F_n = F_(n-1) + F_(n-2)

F_0 = 1;
F_1 = 1;


Ultimately you will implement Fibonacci's sequence using recursion.

-------------------------------------------------------------------
First answer these questions:
-------------------------------------------------------------------

1) How many base cases will there be?
2) For what values of n will the recursion be valid?
3) Will you need a case for invalid input to avoid infinite recursion?



-------------------------------------------------------------------
Now implement Fibonaccis sequence using recursion.
-------------------------------------------------------------------

Assume your executable is called fib.exe
Type the following at the command prompt:
time ./fib.exe
The "user" time is the time I am referring to below:



-------------------------------------------------------------------
After understanding how to use time and implementing the Fibonacci
sequence answer the following:
------------------------------------------------------------------- 
1) For what value is the time above 1s?  
2) Above 5s?  
3) Try to explain why this happens.