Heapsort consists of two steps, heap construction (also called heapification) followed by successive deletions (a.k.a. sortdown or siftdown). How long do these first and second steps take to fully complete?

logarithmic and logarithmic

logarithmic and linear

linear and logarithmic

linear and linear

linearithmic and linear

linear and linearithmic

linearithmic and linearithmic