Objective:

1.

Understand the recurrence relation of sequences

2.

In C++, know how to use the recurrence relation to calculate the n-th term of thesequence, where n is input by users. 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.

1. a_n = 2 * a_n-1 + 3 * a_n-1; a₀ = -2, a₁ = 3.

2. a_n = 2*a_n - n; a₁ = 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. a₀ or/and a₁)

2. If n = 0 or 1, return a₀ or a₁

3. If n != 0 or 1, Write a for loop, return a_n

}