Is the sequence < 23, 7, 14, 6, 13, 10, 1, 5, 17, 12 > a max-heap? If not, show all the steps to

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