I want to construct a Max Heap from a sorted list. What's the worst$-$case time complexity when using the best approach that we have introduced you to$?$ You can assume n is the number of elements in the list.

Question $2$Answer

a$.$

O$($n$2)$

b$.$

O$($n$)$

c$.$

O$($n $*$ logn $+$ n$)$

d$.$

O$($n $*$ logn$)$