Suppose a queue $Q$ and two stacks $S_{1}$ and $S_{2}$ as given below.
void enqueue(Q,x){
push(S1,x);
}
void dequeue(Q,x){
if(stack-empty(S2))then
if(stack-empty(S1))then{
print("Q is empty");
return;
}
else while(!stack-empty(S1)){
x=pop(S1);
push(S2,x);
}
x=pop(S2);
}
The number of push and pop operation needed is represented by $X$ and $Y$, Then $X+Y$ is equal to______________
$Enqueue(4),Enqueue(3),Enqueue(2),Dequeue, Enqueue(6),Dequeue,Dequeue, Dequeue,Enqueue(5)$
Please tell value of X and Y are u getting