Problem $($Use c$++)$

The Fibonacci number is the one in which each number is the sum of the two preceding numbers. An example is shown below:

$0,1,1,2,3,5,8,13,21,34,55,...$

Write a recursive function that prints the first fifteen Fibonacci numbers. Your function must be recursive. Note that the first three Fibonacci numbers are $0,1,1,$ but after that $,$ the Fibonacci number is n $=$ n $-1+$ n $-2.$ Note that you will write only a function.