The number of steps executed by an algorithm is given by
the recurrence T(n)=4T(n/4)+n^2.
What is this alogrithm's time complexity?
Θ(n^2)
Θ(n^2 log n)
Θ(n^3)
Θ(n^3 log n)
None of the above