The enqueue operation on the Queue ADT adds a new item to the back of the queue where the dequeue operation removes and returns the item from the front of the queue. Now consider an initially empty queue and find the final output for the following sequence of queue operations: enqueue(7); enqueue(9); enqueue(1); dequeue(); enqueue(8); dequeue(); dequeue(); enqueue(6); enqueue(3); dequeue(); enqueue(2); enqueue(1); dequeue()