3. Consider the familiar Fibonacci sequence of numbers 0,1, 1,2, 3, 5, 8. 13, 21,34, .. This sequence is "natural" in that it is found in nature defining the leaf arrangement in plants, the pattern of the florets of a flower, the bracts of a pinecone, or the chambers of a nautilus. Its terms can be defined recursively as follows if n-0 if n-l if n> FIBONACCI( n ) = . FIBONACCI( n-1 ) + FIBONACCI( n-2) Obviously, this is a non-decreasing sequence, that is FIBONACCI( m)2 FIBONACCIn) when m n. A proposed recursive algorithm for computing FIBONACCn) is given belows FIBONACCI(n) ifn=0 or n=1 //base cases 2 return n 3 else 4 if n> I 5 return FIBONACCIFIBONACCI(n-2) /the general case On the following pages, provide the answers to the described problems: (more next page) Page 7