Please use MATLAB to solve the following problems. Please include well detailed comments so that I can understand all functions and processes. Do not use a for or while loop. Thanks in advance.

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. (a) an m-1, 0 -1 (b) a F 3a. n-1, a0 (c) an an-1 2n 3, ao 4 (d) an an-1 an-2 an-3, ao 1, a1 1, a2 2 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 1], a 21, 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 an. In MATLAB, you can simply use the operator An Recursion: Cipher (25 points) Write the comments with input, output, and test cases for a recursive function that creates a gibberish" language. So if a letter in a word is a vowel, it is replaced with "ithag", then the vowel, whereas if the letter is a consonant, it is just included normally For instance, the word "dog" would be "dithagog" "math" would be "mit hagath