Case 3: Fibonacci numbers is famous formula in mathematics that generates a sequence of numbers in which the next number is computed based on the previous two numbers (1, 1, 2, 3, 5, 8, 13, 21,...

Please Time table and graph

>n; double A[n]; int n; cout<"input n:\n";="" cin="">>n; for (int i=0;i<><" ";="" fib(a,n);="" for="" (int="" i="">
Extracted text: Case 3: Fibonacci numbers is famous formula in mathematics that generates a sequence of numbers in which the next number is computed based on the previous two numbers (1, 1, 2, 3, 5, 8, 13, 21, 34,..). Program 1 (recursive method) Program 2 (Dynamic Programming method) #include #include using namespace std; using namespace std; void fib(double A[], int n) { int fib(int n) { A[0]=0;A[1]=1; for (int i=2;i<=1) return="" n;="" else="" a[i]="A[i-1]+A[i-2];" return="" fib(n-1)+fib(n-2);="" main()="" {="" }="" main()="" {="" int="" n;=""><"input n:\n";="" cin="">>n; double A[n]; int n; cout<"input n:\n";="" cin="">>n; for (int i=0;i<><" ";="" fib(a,n);="" for="" (int="" i="">
Extracted text: For each case, we want to plot input (n = x-axis) verses execution time (t = y-axis). Each of the above cases has two programs to solve the corresponding problem. We want to compare the behavior of both programs (i.e. practical comparison) by prepare a figure using Excel. Each figure should have two lines, one for the first program and the other for the second program. In addition to the figures, provide the collected data in separated tables.