Heap sort is an implementation of ____________ using a descending priority queue.

• A. insertion sort
• B. selection sort
• C. bubble sort
• D. merge sort