a question in algorithm

3 Solve the following recurrence relations. You may use a s substitution, a recursion tree, or the heorem cannot be used E You ma Theorem. In at least one recurrence relation below, t why not, and solve the recurrence by one of the other method a. Tn) - 16n+277G) b.Tm)- m log(n) + 2.() 71 arch"- in which the list is split int 3 Solve the following recurrence relations. You may use a s substitution, a recursion tree, or the heorem cannot be used E You ma Theorem. In at least one recurrence relation below, t why not, and solve the recurrence by one of the other method a. Tn) - 16n+277G) b.Tm)- m log(n) + 2.() 71 arch"- in which the list is split int