The stack is implemented as a class containing an array of items, a data member indicating the index of the last item put on the stack

(top), and two Boolean data members, underFlow and overFlow. The stack items are characters and MAX_ITEM is 5. In each exercise, show the result of the operation on the stack. Put a T or F for true or false, respectively, in the Boolean data members.

(letter stack. Top()); stack.Pop (); stack. Pop (letter); letter X stack.top .overflow . under Flow .items -1 A / B | C | D [0] [1] [2] [3] [4] letter stack.top .overflow .underFlow .items [0] [1] [2] [3] [4]