Question: Suppose that you want to add the find Min (but not delete Min) operation to the stack repertoire. Implement this class as two stacks, as described in Exercise.
Exercise: Show that the following operations can be supported in constant time simultaneously: push, pop, and find Min. Note that delete Min is not part of the repertoire.