What is the best-case time complexity in terms of big O notation for merge sort?
1) O(logn)
2) O(n)
3) O(nlogn)
4) O(n²)