Which of the following running times for a program sorting n 10-character strings is consistent with the hypothesis that the program is using mergesort?
1) O(n)
2) O(n log n)
3) O(n²)
4) O(log n)