problem1 the fibonacci numbers are defined by the

Question

Problem1:
The Fibonacci numbers are defined by the sequence:

f₁ = 1
f₂ = 1
f_n = f_n-1 + f_n-2.

Reformulate that as

Fold1 = 1;
Fold2=1;
Fnew=fold1+fold2;

After that, discard fold2, which is no longer needed, and set fold2 to fold1, and fold1 to fnew. Repeat an appropriate number of times.

Implement a program that prompts the user for an integer n and prints the nth Fibonacci number, using the above algorithm.