Which of the following is the time complexity of MergeSort?

Select one:

a$.\backslash$Theta $($log n$)$

b$.\backslash$Theta $($n$)$

c$.\backslash$Theta $(2^$n$)$

d$.\backslash$Theta $($n log n$)$

e$.\backslash$Theta $($n$^2)$