How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Provide pseudocode for push, pop, and min which should all operate in O(1) time and explain how your modifications relative to a normal stack work. Hint: You may add additional fields to the node you push on the stack.