Question: A median heap supports the following operations: insert, findKth, and removeKth. The last two find and remove, respectively, the Kth smallest element (where k is a parameter). The simplest implementation maintains the data in sorted order. Do the following:
a. Describe the algorithms that can be used to support median heap operations.
b. What is the Big-Oh running time for each of the basic operations using these algorithms?
c. Write an implementation that uses these algorithms.