Selee P. Tee-Ey has to throw together a function to raise a number to a power to finish graphs in time for her paper submission. Her advisor, however, insists on knowing the runtime of her algorithm. Is she in trouble? def power (x, n): if (n == 0) return 1 else return x * power (x, n-1) (a) Express the runtime of power as a recurrence relation. Specify both T(0) and T(n) (b) Draw a tree and solve your recurrence relation using the substitution method. (c) Solve your recurrence using Master's Theorem if applicable