The worst$-$case runtime to add an element to a heap of size n is $[$ Select $]["$O$($log n$)","$O$($n$)","$O$($n log n$)","$O$($n$^2)","$O$(2^$n$)"].$ The worst$-$case runtime to remove an element from a heap of size n is $[$ Select $]["$O$($log n$)","$O$($n$)","$O$($n log n$)","$O$($n$^2)","$O$(2^$n$)"].$ The worst$-$case runtime of Heap sort is $[$ Select $]["$O$($log n$)","$O$($n$)","$O$($n log n$)","$O$($n$^2)","$O$(2^$n$)"].$

Note: The symbol $^$ means power. E$.$g$.,2^$n $=2$n