Explain why those are 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 in linear time: "n if we disallow duplicates, the best case is: n Ign The average and worst-case number of compares is: ~2 n Ign Explain why those are the best case, average case, and worst-case number of compares for heapsorting an array of length N