Imagine that you are designing an application where you need to perform the operations insert, delete maximum, and delete minimum. for this application, the cost of inserting is not important, because it can be done off-line prior to startup of the time-critical section, but the performance of the two deletion operations are critical. repeated deletions of either kind must work as fast as possible. suggest a data structure that can support this application, and justify your suggestion. what is the time complexity for each of the three key operations?