Consider a database table with n records, where each record has a unique identifier and a key value. We want to sort the records in descending order of key value using Heap Sort algorithm. Which of the following statements is true?

a) We can use a binary heap to sort the records in O(n log n) time.

b) We can use a Fibonacci heap to sort the records in O(n log n) time.

c) We can use a priority queue to sort the records in O(n log n) time.

d) We cannot use Heap Sort algorithm to sort the records in descending order.