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. an-an-1/2+2an-2;a 0, a 2 NOTE: 1. You should implement in recursion. Do NOT use for loop. Function template is int YourFuntionName(int n)l 1. Initialize the starting values (i.e. ao and a1) 2. Return the base case n-0 or 1, return ao 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