We say that a permutation $σ ∈ S_n $ is sortable through a stack if there is a sequence of (PUSH) and (POP) operations such that the initial state:
can be transformed into the final state:
I’m supposed to prove that the permutation 312 is not stack sortable. Other than writing out all the different combinations of possible operations, I’m not sure how to show this.