PROGRAMMING LANGUAGE C

You are now allowed to use the following in additional to the techniques of the previous chapters:

-function prototypes

-functions

-Full math.h library

-Random functions rand() and srand()

-Seed random number generator with and time()

Q2: (Iteration instead of Recursion) (33 points) Any recursive program can be written using iteration instead of recursion. In lecture, you were given a recursive example of the Fibonacci series. Write a nonrecursive function fibonnaci(n) that calculates the nth Fibonacci number. Student design of prompts and responses. You can restrict your program calculate Fibonacci numbers less than or equal to 45 to avoid integer overflows. Again, you may NOT use recursion.