Describe carefully in English, or with a pseudocode, how Exercise 2 to implement the push and pop operations of a stack using only one (single ended) queue and without using the size) method of the queue. You may assume that the elements to be stored in the stack are the 10 digits 0,...9 and that you are allowed to use as marker in the queue the character T" (for "Top"). What is the complexity of these operations? Be succinct but also be clear about the order of the operations to be preformed on the queue