stack permutation of the numbers 0, 1, ..., n-1 is a permutation obtained as the sequence of numbers output by a stack after the original numbers have been processed left-to-right through a stack (via legal push and pop operations).

For example, 0, 3, 2, 1 is a stack permutation of 0, 1, 2, 3 obtained by the sequence of operations: push, pop, push, push, push, pop, pop, pop.

However, the permutation 1, 3, 0, 2 is not a stack permutation of 0, 1, 2, 3

Which of the following sequences are not stack permutations of 0,1,2,3,4,5,6,7,8,9? There could be more than one answer: select all those that you think are correct. There is a penalty for incorrect choices.

Group of answer choices

4, 6, 8, 7, 5, 3, 2, 9, 0, 1

4, 3, 2, 1, 0, 9, 8, 7, 6, 5

2, 5, 6, 7, 4, 8, 9, 3, 1, 0

0, 4, 6, 5, 3, 8, 1, 7, 2, 9