3. 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 or a recursion tree. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as O(n) or O(n log2 n) whenever possible. If the algorithm is exponential just give exponential lower bounds. function func(A,n) if n then return A(1) else for i = 1 to n for j = i to n-1 A(j) A(j) + A(i) + 3 /* endfor */ /* endfor */ y func(A, n-5) return (y)