hi

I need help with this problem. I have tried writting the program, i just can not get it to run properly.

Please Write

The Fibonacci series

0, 1, 1, 2, 3, 5, 8, 13, 21, ...

begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms.

(a) Write a nonrecursive function fibonacci( n ) that calculates the nth Fibonacci number.

and than you