Figures 1(a), (b), and (c) show the initial content of three different implementations of a queue. Assume that the maximum size of all arrays are 4. [0] [2] [3] [1] D A L front rear (a) Queue using linear-array front A [0] [3] [2] L rear (b) Queue using circular-array A DOIT front rear (c) Queue using singly linked-list Figure 1: Three implementations of a queue Perform the following operations to the three different queues in Figure 1. Then, fill in the blanks of the queues after all the operations performed. Write the values of the front and rear. Note: Place the # symbol if the cell/space has no value. enqueue('p') dequeue enqueue('x') Queue 1 [0] [1] [2] (3] front = rear = Queue 2 (iv) [3] [2] (ii) (11) 0) (ii) (iii) (iv) front = rear = Queue 3 (i) ii (iii) (iv) (i) = (ii) (iii) (iv) =