Question $4$

Below is a nearly complete PDA for the language $\backslash ($ L$=\backslash$left$\backslash \{$a$^\{$n$\}$ b$^\{$m$\}\backslash$mid$\backslash$right$.\backslash )\backslash ($ n$>$m$\backslash \}\backslash ).$ Two more triples are needed to finish it$,$ on the transition arrows labeled $"1"$ and $"2".$ In the boxes write the triples that will complete the PDA.

If you need a lambda, type exactly the word "lambda". If you need the empty stack symbol, type exactly the word "emptystack". Do not include any spaces in your answer.