Consider a data structure S supporting two operations: insert(S; x) and extract low(S). Here, extract low returns(and removes) a number y such that y one of the numbers smaller than the current median. Show how to design S such that both the operations can be done in amortized O(1) time.