PROBLEM 3 (Weiss) Give the pseudocode of 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. Be sure to write specify the data structure as class or object with the appropriate elements