Answer and explain this question from Algorithm Design and Analysis class. Thanks

Question 1 Consider the following Queue of characters. (front), and (back), in the figure are written to mark the front and back of the Queue, respectively. Display the queue after the following operations. Enqueue (Z); Enqueue (Y); Enqueue (X); Deque); Deque0; (i) (back) A BCDEF (front) ii) Write a technique to reverse the order of the contents of a Queue with the help of a Stack. For example, the Queue in the above question would look as follows after this reverse operation. (back) F EDCBA (front) i What is the time complexity (using big O-notation) of the reverse technique of Question 1 (ii), considering n as the number of elements in the Queue