Dynamic Median Finder (DMF):

May give your algorithms in either java code or precise pseudo-code.

Problem 4: [3096] Dynamic Median Finder (DMF): We want to design a DMF ADT that maintains a collection of comparable elements and supports the following operations on the collection: insert(e): inserts a given element e in O(logn) time, getMedi)returns the median in 0(1) time, denotes the current number of elements in the collection. where n Give an implementation of the DMF ADT using two heaps as the only instance variables. The median of a collection of n elements is the [n/21th smallest element (ties broken arbitrarily). For instance, the median of (4,9,1 is 4, the median of9, 3, 3> is 3, the median of 19, 9, 1, 2) is 2, and the median of (17,-4, 13,-7, 13, 15, 52) is 5.]