Show that when all elements are distinct, the best-case running time of HEAPSORT is $\Omega(n\lg\ n)$.
