When considering time complexity, what is the average case for MergeSort and why?

n log n because the algorithm runs iteratively $($n$-1)$ times

n log n because the algorithm continually splits the array in half and runs n times

n$2$ because the algorithm has a nested loop

n$2$ because the algorithm runs over the entire array twice