What is the asymptotic running time of the Insert and Extract$-$Min operations, respectively, for a heap with $n$

objects?

$(n)$ and $(1)$

$(logn)$ and $(1)$

$(1)$ and $(logn)$

$(logn)$ and $(logn)$