CIS 407 Week 9 Lab 11: Exercise 9a on page 525 of the eBook provided here.

Week 9 Lab 11: Exercise 9a on page 525 of the eBook provided here.

Due in Week 9 and worth 20 points

Complete the weekly labs based on the following:

• Write the code for each lab assignment.
• The lab is to be submitted in a single zip file in the online course shell, which must contain all .java files, along with any additional files that may be necessary for your project to run (ex: text files). 
• Any and all written answers must be entered into the online course shell with the submission of the attached lab assignment.

Each lab assignment will be graded based on the following: 

1. The program must compile, execute, produce correct results, and meet all of the specifications in the weekly lab. Additionally, you must
2. Organize the code for user readability.
3. Organize the code for reusability.
4. Provide documentation with embedded comments for reader understanding.
5. Organize the code for efficiency.

9. The Fibonacci sequence is the series of integers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ... See the pattern? Each element in the series is the sum of the preceding two items. There is a recursive formula for calculating the nth number of the sequence: a. Write a recursive method fibonacci that returns the nth Fibonacci number when passed the argument n. b. Write a nonrecursive version of method fibonacci. c. Write a driver to test your two versions of method fibonacci. d. Compare the recursive and iterative versions for efficiency. (Use words, not Big-O notation.) e. Can you think of a way to make the recursive version more efficient?