Consider the following queue of character, implemented as a circular queue…

Consider the following queue of character, implemented as a circular queue using an array of 7 one-based memory cells, Front = 3 Rear = 4 Queue: –, –, A, B, __, __, __, where ‘–’, denote empty memory cell. What is the value of front and rear after the following operation? Enqueue C, D

Dequeue

Enqueue E, F

Dequeue