In c++ write a program,

Given the following recurrence relations of two sequences, write a function for each sequence. The function should return the n-th term of the sequence, where n is input by users. Print out the value in the console. 2, an= 2an-1-n; a1 = 2 Hint: 1. A single for loop in the function will suffice 2. Function template is int YourFuntionName(int n) 1. Initialize the starting values (i.e. ao or/and a) 2. If n= 0 or 1, return ao or ai 3. If n != 0 or 1, Write a for loop, retrun an