Please help Report - I/II. Do not copy other solutions. Please write your own words to avoid doing same with others. Tasks:1. Write an iterative C++ function that inputs a nonnegative integer n and returnsthe nth Fibonacci number.2. Write a recursive C++ function that inputs a nonnegative integer n and returnsthe nth Fibonacci number.3. Compare the number of operations and time taken to compute Fibonaccinumbers recursively versus that needed to compute them iteratively.4. Use the above functions to write a C++ program for solving each of the followingcomputational problems.I.Find the exact value of f100, fs00, and f1o00, where fnis the nth Fibonaccinumber. What are times taken to find out the exact values?Find the smallest Fibonacci number greater than 1,000,000 and greaterthan 1,000,000,000.II.I.Find as many prime Fibonacci numbers as you can. It is unknown whetherthere 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.Report: Your report should address all of the below mentioned questions1. Describe the Fibonacci series and write briefly what you have done in theassignment.2. What are the different skills, programming techniques have you used in order torun the experiments?3. What did you observe when you did the comparisons in Task 3 and Task 4?Explain the graph that you have drawn from Task 4.1II?4. List at least three different applications of the Fibonacci numbers to sciences anddescribe one of them in details. Think of situation or a real world problem whereyou can apply concept of Fibonacci numbers to solve it. Explain?5. Write a paragraph, explaining what you have done in this assignment. What werethe challenges you have faced when solving these problems. How can youimprove the programs you have written to solve these problems?

Note: Since the given question is multiple one we are advised to do only first question. Kindly post…

asks: 1. Write an iterative C++ function that inputs a nonnegative integer n and returns the nth Fibonacci number. 2. Write a recursive C++ function that inputs a nonnegative integer n and returns the nth Fibonacci number. 3. Compare the number of operations and time taken to 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.