Solving recurrences using the Master method. Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Solve using the Master method. Assume that T(n) is constant ns 2. Make your bounds as tight as possible and justify your answers. a. T(n) = 4T(n/4) + 5n b. T(n) = 4T(n/5) + 5n C. T(n) = 4T(n/5) + Ign d. T(n) = 4T(n/5) + Igsnyn e. T(n) = 4T(vn) + Ign f. T(n) = T(vn) + 5