The queue is implemented as a class containing an array of items, a data member

ID: 3679824 • Letter: T

Question

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. the item type is char and maxQue is 5. Show the result of the operation on the queue. Indicate what goes in the spaces marked (a)? through (j)?. Choose "T" or "F" for True or False in the Boolean data members. If there should be no entry in the space, choose "no entry." Some answer choices may be selcted more than once, or not at all.

queue.Enqueue (letter);

Letter

(a)?

queue.front

(b)?

.rear

(c)?

.overFlow

(d)?

.underFlow

(e)?

.items

(f)?

(g)?

(h)?

(i)?

(j)?

[0]

[1]

[2]

[3]

[4]

[0]

[1]

[2]

[3]

[4]

(a)? would be "J" for example