$**$Not sure about this question$**$

What's the overall complexity of building a max$-$priority queue with $n$ elements using a

max$-$heap and then extracting the maximum element?

A$.O(n)$

B$.(nlgn)$

C$.O(lgn)$

D$.(n+lgn)$