Problem 2 [15 points]: Recall that a queue is a linear data structure that behaves in a IFO (first in, first out) manner. In particular, a queue maintains a sequential ordering of the elements contained within the queue and supports the following operations/methods: ENQUEUE(x): Add element r to the end of the queue DEQUEUEO: Remove the element at the front of the queue and return it Suppose you are given two stacks Si and S2. Describe how to implement a queue with just Si and S2. In particular, you should give a description for how both and ENQUEUE and DEQUEUE are implemented. Note that you are not permitted to use any other data structures other than Si or S2 in your implementation (an array, a linked list, etc.)