Consider a stack S and a queue Q. Both initially empty with capacity 10. Elements 1, 2, 3, 4, 5 arrive in order. Each is assigned to S (pushed) or Q (enqueued). After all five are stored, S is emptied by popping all elements, then Q is emptied by dequeueing all elements. The output is 4 3 1 2 5.Which of the following options is/are possible valid assignments?(Note: xS denotes element x assigned to S, yQ denotes y assigned to Q.)