A. [5 points] Consider an empty stack of integers. Let the numbers 1,2,3,4,5,6 be pushed onto this stack in the order they appear from left to right. Let A indicate a push and P indicate a pop and print operation. For example, AAPP will output 21. - What is the output of AAAPPAAPAPPP? - How can we generate the following output: 154632 ? B. [5 points] Given an integer k and a queue of integers, how do you reverse the order of the first k elements of the queue, leaving the other elements in the same relative order? For example, if k=4 and queue has the elements [10(F),20,30,40,50,60,70,80,90(L)] the queue should become [40(F),30,20,10,50,60,70,80,90(L)]. Implement the above task using a non-member function. If k is larger than the number of elements in the queue, reverse the whole queue. void partialRev(QueueArray\& Q, int k ) \{