$3.$ You are asked to imitate queue Q by using two stacks S$1$ and S$2.$ Explain, step$-$bystep, how enqueue and dequeue can be achieved. You can explain by words or by writing codes in C$.$

Recall that a stack abstract data type has the following operations:

Page $2$

Hint: Use S$1$ as the front stack of Q $($denoted by $\backslash (\backslash$mathrm$\{$Q$\}\backslash$rightarrow $\backslash$mathrm$\{$S$\}1\backslash )),$ S$2$ as the rear stack $($denoted by $\backslash (\backslash$mathrm$\{$Q$\}\backslash$rightarrow $\backslash$mathrm$\{$S$\}2\backslash )).$