Problem 1For each of the following recurrences, give an expression for the runtime T(n) if the recurrence can be solvedwith the Master Theorem. Otherwise, indicate that the Master Theorem does not apply. Remember to showevery step clearly.
Problem 2 Using the recursion tree method, solve the following recurrences. Take as many pages as you want. Clearlyshow every steps including calculation of tree height, etc. Explain the steps wherever necessary.
"Place your order now for a similar assignment and have exceptional work written by our team of experts, guaranteeing you A results."