a) (4 points) You are given an initially empty queue and perform the following operations on it: enqueue(B), enqueue(A), enqueue(T), enqueue(I), dequeue), dequeue), enqueue(Z), enqueue(A), dequeue), enqueue(I), enqueue(N), enqueue(L), dequeue), enqueue(G), enqueue(A), enqueue(R), enqueue(F), dequeue), dequeue). Show the contents of the queue after all operations have been performed and indicate where the front and end of the queue are. the queue, you are only allowed to use the methods of a queue ADT. Hint: Consider using an auxiliary data structure