Solve the following recurrences using the Master Theorem. Show the steps. 1) T (n) = 3T (2) + 2n 2) T (n) = 8T (2/2) + 2n³

Solve the following recurrence relationship M(n) = 3M(n-1) + 1, M(O) = 5

Use the master method to give tight asymptotic bounds for the following reccurences. Mentionwhich case (1, 2, or 3) of the theorem you are applying.(a) T(n) = 2T(n/4) + 1(b) T(n) = 2T(n/4) + √n(c) T(n) = 2T(n/4) + n(d) T(n) = 2T(n/4) + n2

Solve the following recurrences using iteration methods and Master's Theorem (if possible) a. T(n) = 4T (²7) + 3n+1 2 b. T(n) = 3T (²) + 2n − 5 6 c. _T(n) = 6T (²) +n²log n (Master's Theorem only)