a. Propose a data structure that supports the stack push and pop operations and a third operation FindMin, which returns the smallest element in the data structure, all in O(1) worst case time.

b. Prove that if we add the fourth operation DeleteMin which finds and removes the smallest element, then at least one of the operations must take (log n) time.