For each of the following algorithms, what is the tightest asymptotic upper bound for its runtime complexity for nnn numbers?
MAX-HEAPIFY for a max-heap: expected time?
