Comparing two complexities: O(n log n) vs O(n²). For large n, which is smaller?

Question

Accepted Answer

(B) O(n log n). Explanation: For large n, log n << n so n log n << n². O(n log n) grows slower.