You are given a heap with n elements that supports Insert and Extract-Min. Which of the following tasks can you achieve in O(log n) time? A. Find the largest element stored in the heap B. Find the fifth-smallest element stored in the heap C. Find the median of the elements stored in the heap. D. None of these.
