I want a queue and stack drawing in all the steps, I don't want an explanation just for a question

Exercise 4 Assume that you have a stack S, a queue Q and the standard stack - queue operations: push, pop, enqueue and dequeue. Assume that print is a function that prints the value of its argument. Execute, in top-to-bottom order. push(s, 'T'); enqueue(Q 1); push(s,dequeue(Q)); print(pop()); print(dequeue(Q))