Suppose you've implemented a queue using a "circular array. Show what happens with the beginning and end pointers if 23 perform the following set of operations in order, assuming the array is of size 4. Show the contents of the queue, give the size, and the locations of the beginning and end of the queue for each step. enqueue(1); enqueue(2); enqueue(3); dequeue(); dequeue(); enqueue(4); dequeue(); enqueue(5); dequeue(); dequeue(); enqueue(6); dequeue(); enqueue(7)