Question 5: (a) Suppose we modify the standard StackType ADT studied in class by adding a Min() member function, that returns the smallest item currently in the stack. (Assume that operators is available for ItemType.) What is the O0 time complexity of Min0)? Justify your answer. (1 mark) (b) Suppose we add to StackType a min member variable, to store the smallest value. Now Min() will be O(I), but what are the changes required to Push) and Pop), and their O0 time complexity? Explain. (2 marks) (c) Generalizing your observations above, explain how we could modify Min), Push() and Pop(0, so that all three operations have O(1) time complexity. Explain clearly your design (no code is required)