Foundations — complexity and edge cases

You sort an array of n numbers with a comparison-based sort that always does Θ(n log n) work. What is the tightest typical bound on extra memory for merge sort?