The merge sort algorithm satisfies the recurrence $T(n) = 2T(n/2) + n$ for $n > 1$, with $T(1) = 0$. Which of the following best describes $\Theta(T(n))$?