(Fibonacci Series) 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...

C++ program

Extracted text: (Fibonacci Series) 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 uses type int to calculate the nth Fibonacci number. (b) Determine the largest int Fibonacci number that can be printed on your system. Modify the program of part (a) to use double instead of int to calculate and return Fibo- nacci numbers, and use this modified program to repeat part (b).