[C++ Programming]Please help 4-III. 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.

Given:C++ Code: #include<iostream>#include<ctime>#include<cmath>#include <stdio.h>using namespace std;long long fib(int);int main(){ time_t start,end; time (&start); long long k=fib(100); cout<<endl<<"Fib("<<100<<") = "<<k<<endl; time (&end); double diff = difftime (end,start); printf ("Time taken : %.2f seconds.\n", diff ); time (&start); k=fib(500); cout<<endl<<"Fib("<<500<<") = "<<k<<endl; time (&end); diff = difftime (end,start); printf ("Time taken : %.2f seconds.\n", diff ); time (&start); k=fib(1000); cout<<endl<<"Fib("<<1000<<") = "<<k<<endl; time (&end); diff = difftime (end,start); printf ("Time taken : %.2f seconds.\n", diff ); return 0;}long long fib(int fib){ long long n1=0,n2=1,next; for(int i=0;i<fib;i++) { if(i==fib-1) break; next=n1+n2; n1=n2; n2=next; } return n1;}Code screenshot:Output: