What is the worst$-$case time complexity of build$-$heap on $n$ elements?

$O(nlogn)$

None of them

$O(n)$

$O(n^2)$

$O(logn)$

$O(1)$