Suppose that five values are pushed into a Stack data structure in the following order$11\mathrm{.}3\mathrm{.}5\mathrm{.}2$ Then the values are popped" one by one from this Stack and then enqueued into a Queue data structure Which value would be the first that can be dequeued from this Queue? Suppose that the Stack and the Queue were intially empty