In c language

in mathematics, the Fibonacci numbers (in this case only positive numbers) are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones 0 1 1 23 5 8 13 21 34 55 89 144 Write a function called fibonacci that takes two integers arguments and prints out in ascending order all fibonacci numbers between the first (or closest higher or equal) and the second argument (closest lower or equal). Your function must return the amount of fibonacci numbers printed out Example 1: When the input is 34 The output is 5 8 13 21 34 The function must return 5 Example 2 When the input is 100 The output is 5 8 13 21 34 55 89 The function must return 7 Requirements Read the inputs from the user Declare the prototype of your function before the main function Call your function to do the printing based on the inputs from the user . . Print a space after each number including the last one printed