write this in c++

Given the following recurrence relation of a sequence, write a function that returns the n-th term of the sequence, where n is input by users. Print out the value in the console. 1. a.-an-1/2 + 2 an-2 , a,-0, al-2. NOTE: 1. You should implement in recursion. Do NOT use for loop 2. Function template is int YourFuntionName(int n) Initialize the starting values (i.e. ao and a1) 1. 2. Return the base case : n 0 3. If not the base case: of the function or 1, return ao or a1 return the recursive call