method: 1- Solve these recussion with substitution a) T (n)= T(n , tn - by T (n) = 4T (A/2) + - q - Double check your answers to question 1, by using the master method to find the smallest correct upper bound on the asymptotic ruming time of the algorithms. Conside Tans is the running time of the algorithms. 1. Some as Tcni s T (?) to (n) bi. T(nje 4 T (M ) +0(1)