[5] Mr. B. C. Dull claims to have developed a new data structure for priority queues
that supports the operations Insert, Maximum, and Extract-Max—all in O(1) worst-case time. Prove that he is mistaken. (Hint: the argument does not involve a lot of gory details—just think about what this would imply about the Ω(n log n) lower bound for sorting.)