I need to create fibonacci's formula in C++ using a recursive and non-recursive formula. After doing so, I have to time each operation for for the following numbers of the sequence:

1, 5, 10, 15, 20, 25

I have to time how long the program took to perform each number recursive vs non recursive. Code in C++