Question 5: (a) Suppose we modify the standard Stack ADT studied in class by adding a min) member function that returns the smallest item currently in the stack. Assume no other change is made, and that stack objects can be compared with operator<. what is the o time complexity of min function justify your answer. mark now we add a member variable to store smallest value so that simply returns in modifications are needed push0 and pop accordingly their marks generalizing observations above explain how could modify all three operations have clearly design no code required.>