PLEASE SOLVE IT USING C++. DO NOT WRITE IN C PLEASE.

1. Let S1 and S2 be the two stacks to be used in the implementation of our queue. All we have to do is to define the enqueue and dequeue operations for the queue. enqueue(T a) S1.push(a); dequeue()\{ if (S1 is empty) return(error); while(S1 is not empty)\{ S2.push(S1.popO); r = S2.pop0; while(S2 is not empty)\{ S1.push(S2.popO); return(r); Use your stack implementation to implement a queue using the above pseudocode