Question: Which of the following statements about heaps in Data Structures is correct?

A) A Min-Heap always has the largest element at the root.
B) The time complexity of inserting an element into a binary heap is O(n) because the heap needs to maintain the heap property.
C) A heap can be used to efficiently implement a priority queue, ensuring that both insertion and extraction of the minimum or maximum element are logarithmic operations.
D) In a Max-Heap, the parent node is always smaller than its child nodes.