Fibonacci Sequence Through Programming.

For Option #1, you will be exploring the Fibonacci sequence through programming. Complete the following tasks:

a. Research and take note of the recursive formula F(n) that can be used to define the Fibonacci sequence.

b. 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.

c. Determine the number of times your program computes F(1) for each time F(5) is computed.

d. Discuss any issues you find with your program and what reasoning there may be.

Additional Requirements:

1. Paper must be written in third person.

2. 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. …

3. Include a title page, introduction, body, conclusion, and a reference page.

4. 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.

5. 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. Be sure this is in paragraph format, not numbered answers like a homework assignment.

6. The conclusion should summarize your thoughts about what you have determined from the data and your analysis, often with a broader personal or societal perspective in mind. Nothing new should be introduced in the conclusion that was not previously discussed in the body paragraphs.

7. Include any tables of data or calculations, calculated values, and/or graphs associated with this problem in the body of your assignment.

Fibonacci Sequence Through Programming.