Solve the following recurrence relation without using the master method! report the big O 1. T(n)…

Solve the following recurrence relation without using the master
method! report the big O
1. T(n) = 2T(n/2) =n^2
2. T(n) = 5T(n/4) + sqrt(n)