Imagine that you are designing an application where you need to perform the operations Insert, DeleteMaximum, and Delete Minimum. For this application, the cost of inserting is not important, because itcan be done off-line prior to startup of the time-critical section, but the performance of the two deletionoperations are critical. Repeated deletions of either kind must work as fast as possible. Suggest a datastructure that can support this application, and justify your suggestion. What is the time complexity foreach of the three key operation