Exercise $2.$ Assume we are reading the following input: $"12345".$ We read the characters one by one, and we are only allowed to store them in an $($initially empty$)$ stack. So$,$ at any point of time, we read a character, we can push it to the top of the stack, and at any point, we are allowed to pop the top of the stack and print the popped element in the output. Staring from the given input, we would like to know if we can output the following permutations of numbers. Assume we have a stack $s,$ which has two methods s$.$push$($int $x$ and s$.$pop$().$ The pop method also prints the element automatically.

a$)32541$

points