The PDA below accepts the language Onan for all n20. State diagram for a PDA 0,8-0 1,0-8 E,-$ 8,88 E,$- 90 91 92 93 onin Grafstate Which of the following transitions, if added to this PDA, would make this PDA so it the PDA accepts oml" where msn instead? Select all that apply. Add (91,0) to 5191,,) Add (91,) to 8(91,0,8) Add (92,) to 5192,1,8) Add (92,0) to 8192,1,0) Add (91,) to 8(91,0,8) Question 2 (1 point) What is the sequence of states that the PDA presented in problem 1 will go through when computing the string 000111? 909191919292929293 90919191929292929293 90919191919292929293 9091919192929293 9091919191929292929293