Help me solve the two questions

Question NO.1 : T(n) = 4T (5n/2) + cn? Analyze the recurrence shown above, then use the substitution method to prove the following guess : T(n) = (n) Question NO.2: Use the master method, to show the solution to the recurrence below T(n) = 16 T(1/4) + 2(n) Theorem 4.1 (Master theorem) 1. If 801) = o(la) for some constante > 0, then T (11) = (logo). 2. If 01) - (nog), then T (1) = (108" Ign). 3. If S01 - 820 ) for some constante > 0, and if af (1/1) sof () for some constant c