A queue is maintained using circular array queue [0 .. 3] with four elements.

Fill in the table to perform the queue operations. Show the contents of the queue after each operation. Display corresponding messages in the rightmost column if any. The first column shows the input entered.

Operation(Input) front rear queue[0] queue[1] queue[2] queue[3] Message

Tail Queue(0) Queue(1) Queue(2) Queue(3) Message Operation Head Initially Add 2 Add 7 Add 'S Delete Add 4 Addo Add9 Delete Delete Delete Delete #include votd AddQueue (item_type item) if Full cout TAI switch(tag 1 case 1: cout Enter": cin >> Item AddQueue item break case 0: DeleteQueue () break: default: coute "Incorrect. Enter again.": 1 cout > flag: 1 return 0; bool Empty) 17 (queceres-1) return true return false; 1 bool Full Afiquese.er - queue. Front- queue.rear > -1111 queue.tear -- MAXQUEUE - 6 quese.front -- 0 return true; return false; 1