1. Write an iterative C++ function that inputs a nonnegative 2. Write a recursive C++ function that inputs a nonnegative 3. Compare the number of operations and time taken to integer n and returns the nth Fibonacci number integer n and returns the nth Fibonacci number. compute Fibonacci numbers recursively versus that needed to compute them iteratively. 4. Use the above functions to write a C++ program for solving each of the following computational problems I. Find the exact value of fioo, /s00, and fiooo, where fn is the nth Fibonacci number. What are times taken to find out the exact values? II. Find the smallest Fibonacci number greater than 1,000,000 and greater than 1,000,000,000 III. Find as many prime Fibonacci numbers as you can. It is unknown whether there are infinitely many of these. Find out the times taken to find first 10, 20, 30,40. up to 200 and draw a graph and see the pattern