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.
UK: +44 748 007-0908, USA: +1 917 810-5386
[email protected]
