Figures 1(a) and (b), show the initial content of two more different implementations of a queue. Assume the maximum size of all arrays is 4. [0] [2] [3] 20 65 43 front rear (a) Queue 1 front 20 [3] [0] [2] [1] 43 65 rear (b) Queue 2 Figure 1: Two implementations of a queue Perform the following operations to the two 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 (37); dequeue(); enqueue (56); enqueue (78); Queue 1 [0] [1] [2] N [3] front = rear = Queue 2 (iv) [3] [0] [1] [2] (111) (ii) (0) (ii) (iv) = front = rear =