Which of the following is the best case time complexity of Heapsort?

Select one:

$\backslash$Theta $($n$)$

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

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

$\backslash$Theta $($nlog n$)$

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