The depth of a min$-$heap that contains n items is:

Group of answer choices

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

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

$\backslash$Theta $(1)$

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