2. (10) Let Q be a nonempty queue containing n elements of type T and S be an empty stack that can contain n elements of type T. Using only queue and stack ADT operations as shown in class and a single variable X of type T write an efficient algorithm to reverse the elements of queue Q. Explain the asymptotic worst-case running time of your algorithm