Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. If you were to modify the transitions labeled by a,b,ε and b,a,ε and were to modify them to a,b,ab and b,a,ba respectively, what consequence would this lead to?