How much time does it take to remove the smallest item from a min$-$heap that contains n items?

Group of answer choices

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

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

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

$\backslash$Theta $(1)$