How would you design a stack which, in addition to the traditional push and pop operations, also supports an operation called min which returns the element having the minimum value in the stack? push,...

How would you design a stack which, in addition to the traditional push and pop operations, also supports an operation called min

which returns the element having the minimum value in the stack? push, pop, and min

should all operate in O(1) time.