Please help with this question.

5. Write a program and a recursive function that finds a Fibonacci Series. The program will ask the user for three integer values: the first and second values of the series and the total number of values to find. A Fibonacci Series adds the last two values to get the current value (e.g. starting with 1 1, add the values to get 1 1 2; then add the last two values to get 1 1 2 3; then again to get 1 1 2 3 5 and so on). (10 pts): Main program Ask for the 3 values (assume that the number of values is greater than 2) Print the first 2 values Call the function with the 3 values (since the first two values are already done, the number of values should be decremented by 2) Function Check if the number of values left is greater than zero Add the two values Print the result Change the last two values Decrement the number of values left by 1 Call the function again