What's the best case, average case, and worst case number of compares for heapsorting an array of length N?

If we allow duplicates, the best case is ______________________

if we disallow duplicates, the best case is_____________________

The average and worst case number of compares is _______________________

Explain why those are the best case, average case, and worst case number of compares for heapsorting an array of length N?