2. S1 and S2 be the two stacks to be used in the implementation of our queue. As in the previous implementation, we have to define enqueue and dequeue operations. enqueue( T a) S1.push(a); dequeue()\{ if (S1 is empty \& S2 is empty) return(error); if (S2 is empty) while(S1 is not empty) S2.push(S1.pop()); 3 return(S2.pop()); 3 Use your stack implementation to implement a queue using the above pseudocode