(10 points) In the class, you learned the recurrence relation and backward substitution to get the time complexity of a recursive algorithm. To remind the topic, read the Google document again at https://goo.gl/HmoUNO Solve the following recurrence relations using the backward substitution. You have to present intermediate steps as described. (a) for n>1 M(n) = 2*M(n-1) M(1) = 3 // recurrence relation // initial condition (b) for n>1 M(n) = 3*M(n-1) M(1) = 4 // recurrence relation // initial condition