can someone solve this for me ? please explain well

The collection data type OrderedBag supports two operations: add0, which inserts an element into the bag (just like in the Bag data type); and removeSmallest0, which removes the smallest element from the bag and returns it. Explain why no comparison-based implementation of OrderedBag is possible where both operations are require at most ~ log n comparisons in the worst case