Write a program in C++ which compares the execution time of Recursive and Iterative algorithms using the stl stack template of the Fibonacci sequence using a function pointer. The Fibonacci sequence is defined as follows:

f_n = f_n-1 + f_n-2 where n > 1

f₁= 1

f₀ = 0.

Compare the execution time of the above approaches for n = 25.

The output should look as follows:

Your name

CIS 5

Spring, 2018

The sequence

0, 1, 1, 2, 3, 5 ......

Recursive 0.001

Iterative .0.002

Use the following high resolution Windows 32 API timer in linked library winmm.lib.

#include

#include

#include

int main (void)

{

float time;

//defines start, finish, duration

DWORD start, finish, duration, pause;

//start the timer

if(timeBeginPeriod(1) = TIMERR_NOERROR)

{

//get the starting time

start = timeGetTime();

//write iterative code here using stack template class library to get the fibonacci sequence

//Get the ending time

finish = timeGetTime();

//calculate duration

duration = finish - start;

}

//stop the timer

timeEndPeriod(1);

//calculate the time in seconds

time = (float)duration/1000;

//print the time and pause

cout << "process took" <

cin>>pause;

return 1;

}