Write a recurrence relation describing the worst case running time of the following algorithm and determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using substitution/expansion. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as theta(n^k) or theta(n^k log_2 n) whenever possible. If the algorithm is exponential just give exponential lower bounds. function func(A, n) if n