show that the worst-case running time of heapsort is Ω(nlgn).?

Answer 1

Easy:

Figure out what the worst input for heapsort would look like.
Explain the behavior of heapsort, given this input.

I'm not going to give you any more detail, becasue that would be doing your college work for you.