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

(rear), a data member indicating the index of the location before the first item put on the queue (front), and two Boolean data members, underFlow and overFlow, as discussed in this chapter. The item type is char and maxQue is 5. For each exercise, show the result of the operation on the queue. Put a T or F for true or false, respectively, in the Boolean data members.

queue. Dequeue (letter); letter queue.front .rear .overFlow .underFlow .items 4 2 V | W | X Y 2 [0] [1] [2] [3] [4] letter queue.front rear overflow .underFlow .items [0] [1] [2] [3] [4]