Suppose you have a queue in which the values 1 through 5 must be enqueued on the queue in that order, but that an item on the queue can be dequeued and printed at any time. Based on these constraints, give the list of operations that would produce each of the following sequences. If it is not possible, state so. a. 1 3 5 4 2 b. 1 2 3 4 5 c. Are there sequences that cannot occur