Recurrence Relations

Using C++, write recursive functions with test cases that output the first six terms of the sequence defined by each of these recurrence relations and initial conditions. (a) a_n = 2a_n1, a₀ = 1 (b) a_n = 3a²_n1, a₀ = 1 (c) a_n = a_n1 + 2_n + 3, a₀ = 4 (d) a_n = a_n1 a_n2 a_n3, a₀ = 1, a₁ = 1, a₂ = 2

Note: In C++ it will be a[0], a[1], a[2], a[3], a[4], a[5].

Do not use pow function but create a recursive function raisePow(x,n) that solves xⁿ