5.35 (Fibonacci) The Fibonacci series 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. Use unsigned int for the function's parameter and unsigned long long int for its return type. b) Determine the largest Fibonacci number that can be printed on your system