Fibonacci Sequence Through Programming.

Research and take note of the recursive formula F(n) that can be used to define the Fibonacci sequence. Design a simple program, using pseudocode, to implement the recursive formula you found in part (a) to compute numbers in the Fibonacci sequence. Describe in detail how your program implements the recursive formula. You may find it useful to discuss how it through a concrete example such as F(8) = 21. Determine the number of times your program computes F(1) for each time F(5) is computed. Discuss any issues you find with your program and what reasoning there may be. Additional Requirements: Paper must be written in third person. Your paper should be 3-4 pages in length (not counting the title page and references page) and cite and integrate at least one credible outside source. Include a title page, introduction, body, conclusion, and a reference page. The introduction should describe or summarize the topic or problem. It might discuss the importance of the topic or how it affects you or society as a whole, or it might discuss or describe the unique terminology associated with the topic. The body of your paper should answer the questions posed in the problem. Explain how you approached and answered the question or solved the problem, and, for each question, show all steps involved.