Let’s revisit the Fibonacci sequence, this time without anarray. Recall that the sequence is defined by the followingrecurrence relation: F0 = 0 F1 = 1 Fk = Fk-1 + Fk-2 So, thesequence looks like: 0, 1, 1, 2, 3, 5, 8, 13, 21, … Write a programfib.c consisting only of a main() function that prompts the userfor the last Fibonacci number n to print, and then prints them fromF0 to Fn. (No file input needed.) For instance, if the user enters4, the output should be: F0: 0 F1: 1 F2: 1 F3: 2 F4: 3 Again, noarrays or pointers. For full credit use no more than five integervariables (and no other variables). You may assume that n >1.
