What is the average number of comparisons used to heap sort a random permutation of N distinct items?

What is the average number of comparisons used to heap sort a random p

1.	What is the average number of comparisons used to heap sort a random permutation of N distinct items?
A.	2N log N-O(N)
B.	2N log N-O(N log N)
C.	2N log N-O(N log log N)
D.	2N log N-O(log N)
Answer» D. 2N log N-O(log N)