Problem 2 [15 points]: Recall that a queue is a linear data structure that behaves in a FIFO (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(): 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 witlh ust S and S2 . In particular, you should give a description for how both and ENQUEUEO and DEQUEUEO are implemented. Note that you are not permitted to use any other data structures other than S or S2 in your implementation (an array, a linked list, etc.)