heapify the sequence. Show that the worst-case running time to heapify a sequence of size n is Ω (logn).