In divide-and-conquer algorithms, a recurrence like $T(n) = 2T(\frac{n}{2}) + n$ describes the time complexity. Using the Master Theorem, what is the asymptotic complexity?