Chapter 5, Problem 5.48E

(Research Project: 1m proving the Recursive Fibonacci Implementation) In Section 5.15, the recursive algorithm we used to calculate Fibonacci numbers was intuitively appealing. However, recall that the algorithm resulted in the exponential explosion of recursive function calls. Research the recursive Fibonacci implementation online. Study the various approaches, including the iterative version ¡n Exercise 5.35 and versions that use only so called “tail recursion.” Discuss the relative merits of each.