Hello, I would like to get help with the following question, thanks in advance.

4. Understanding and Applying Lower Bounds

Suppose Dr. WhyLie comes up to you and claims that he has invented a super-fast comparison based priority queue. The speed of the priority queue operations are as follows (n is the number of items currently in the priority queue):

a. insert a new item in O(sqrt(log n)) time

b. extract (remove and return) the smallest item from the priority queue in O(sqrt(log n)) time.

Explain why Dr. WhyLie must be lying.