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$)$ theta$($nlgn$)$

c$)$O$($lgn$)$

d$)$theta$($n$+$lgn$)$