In the Master Theorem, what is the asymptotic solution for the recurrence T(n) = 4T(n/2) + n?

Θ(n²)

This falls under Case 1 of the Master Theorem because f(n) = n is polynomially smaller than n^(log_2 4), which is n^2. Therefore, the complexity is dominated by the recursive work.