ESTION 1 Apply the following operations, assuming an empty data structure to begin with. enqueue(‘S); enqueue (‘K); enqueue(T); enqueue(‘P’); enqueue(“L’); dequeue); dequeue 0: enqueue(D); dequeue 0; dequeue 0: front); enqueue(‘E’); enqueue(‘X); enqueue(T; dequeue 0: enqueue(‘R); For your answers, use only LETTERS, no spaces, no commas, no punctuation. What letters remain in this structure after all these operations are completed, if you read it from front to back? What letters are the return values of these operations in the exact order
OR
OR