Please use C++ Programming

Objective: 1. Learn to implement functions using recursion in C++ Given the following recurrence relation of a sequence, write a function that returns e n is input by users. Print console an-1 +2 an-2 an ao -0 a12. NOTE 1. You should implement in recursion. Do NOT use for loop. 2. Function template is int YourFuntionName(int n) 1. Initialize the starting values (i.e. ao and a) 2. Return the base case n 0 or 1, return a or a 3. If not the base case return the recursive call of the function options compilation execution Please input an integer: For n 3, an 4.5