[C++ Programming]Please help 4-II. Do not copy other solutions. Please write your own progrmming to avoid doing same with others. 4. Use the above functions to write a C++ program for solving each of the followingcomputational problems.I.Find the exact value of fi00, fs00, and f1000, where fn is the nth Fibonaccinumber. What are times taken to find out the exact values?II.Find the smallest Fibonacci number greater than 1,000,000 and greaterthan 1,000,000,000.III.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.

Fibonacci Number: The Fibonacci numbers is also known as Fibonacci Sequence, it is defined as the sequence of numbers in which each number in the sequence is equal to the sum of two numbers before it. The Fibonacci Sequence is given as: Fibonacci Number = 0, 1, 1, 2, 3, 5, 8, 13, 21, …. Here, the third term “1” is obtained by adding first and second term. (i.e., 0+1 = 1) Similarly, “2” is obtained by adding the second and third term (1+1 = 2) “3” is obtained by adding the third and fourth term (1+2) and so on. For example, the next term after 21 can be found by adding 13 and 21. Therefore, the next term in the sequence is 34. Fibonacci Number Formula: The Fibonacci sequence of numbers “Fn” is defined using the recursive relation with the seed values F0=0 and F1=1: Fn = Fn-1+Fn-2 Here, the sequence is defined using two different parts, such as kick-off and recursive relation. The kick-off part is F0=0 and F1=1. The recursive relation part is Fn = Fn-1+Fn-2. It is noted that the sequence starts with 0 rather than 1. So, F5 should be the 6th term of the sequence.C++ Program for the smallest Fibonacci Number greater than 1,000,000 and greater than 1,000,000,000: #include <iostream>using namespace std; int main(){ int f1 = 0, f2 = 1, nextTerm = 0; cout << "Smallest Fibonacci Number greater than 1000000: "; while(nextTerm < 1000000) { nextTerm = f1 + f2; //fibonacci equation f1 = f2; //updating variable f2 = nextTerm; } cout << nextTerm << " "; cout<<endl; int n1 = 0, n2 = 1, nextNumber = 0; cout << "Smallest Fibonacci Number greater than 1000000000: "; while(nextNumber < 1000000000) { nextNumber = n1 + n2; //fibonacci equation n1 = n2; //updating variable n2 = nextNumber; } cout << nextNumber << " "; return 0;} Output of above code: Smallest Fibonacci Number greater than 1000000: 1346269 Smallest Fibonacci Number greater than 1000000000: 1134903170 Screenshot of code: Screenshot of output: