StackType stack; item1 = 1; item2 = 0; item3 = 4; stack.Push(item2); stack.Push(item1); stack.Push(item1 + item3); stack.Pop(item2); stack.Push(item3*item3); stack.Push(item2); stack.Push(3); stack.Pop(item1); cout << item1 << end1 << item2 << end1 << item3 << end1; while (!stack.IsEmpty()) { stack.Pop(item1); cout << item1 << end1; } StackType stack; item1 = 4; item3 = 0; item2 = item1 + 1; stack.Push(item2); stack.Push(item2 + 1); stack.Push(item1); stack.Pop(item2); item1 = item2 + 1; stack.Push(item1); stack.Push(item3); while (!stack.IsEmpty()) { stack.Pop(item3); cout << item3 << end1; } cout << item1 << end1 << item2 << end1 << item3 << end1; Use the following information for Exercises 4-7. 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.

The link below has the images for exercises 4-7. I need to know answers to the boxes.

https://www.chegg.com/homework-help/questions-and-answers/stacktype-stack-item1-1-item2-0-item3-4-stackpush-item2-stackpush-item1-stackpush-item1-it-q10828261