Screenshot 2021-02-08 at 16.10.50 Screenshot 2021-02-08 at 16.11.18 Screenshot 2021-02-08 at 16.12.40 Screenshot 2021-02-08 at 16.17.05 Q Search Use the Master method (cases listed below) to solve the recurrence: T( n ) = 2 ( n/4 ) + n^2 Master method cases: 1. If f(n) = O(nlogo(a)-c) for some constant e > 0, then T(n) = ( nlogb(a)) 2. If f(n) = (nlogb(a)), then T(n ) = ( nlog(a) Ig n) 3. Iff(n) = 2(nlogb(a)+E) for some constant > 0, and if af n/b) s cf(n) for some constant c