In this lab, you may use MATLAB to implement the Recursion problems. Do not use a for or a while loop to implement a recursive function.

2. Recurrence Relations (25 points) 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. an-1, ao -1 a) an -2a (b) a 3a n-1, ao (c) an an-1 2n 3, ao 4 Note: In MATLAB, the first index will be 1 and not 0. So the first six terms will be a(1), a (2), a(3), a(4), a (5), a(6) whereas in C++ it will be a 0, a l, al2, a 3], a 4], a 5]. If you're implementing in C++, do not use pow function but create a recursive function raisePow(x,n) that solves rn. In MATLAB, you can simply use the operator zAn