Write a C++ program that asks how many Fibonacci numbers it should compute and then shows each computed Fibonacci numbers. I believe I have to use a for loop for this.

Exercise 4: Fibonacci Numbers Fibonacci numbers pop up all over the place and are related to the golden ratio. You can find the next Fibonacci number by adding together the previous two. The first two Fibonacci numbers are F. = 0, F, = 1. Thus: F2 = F, + Fo = 1 + 0 = 1 Fz = F, + F, = 1 + 1 = 2 FA = Fz + F, = 2 + 1 = 3 Write a program that asks how many Fibonacci numbers it should compute and then shows each computed Fibonacci numbers. Example Output (underlined values are user inputs) Enter the value for FO and F1: 0 1 Enter last Fibonacci numbers you want FN (Enter N): F2=F1+F0=1+0=1 F3=F2+F1=1+1=2 F4=F3+F2=2+1=3