#5 please

b. Use the UFG from Part a to give a pushdown automaton that recognizes L. 5. Let L be the set of strings over {a,b,c) where the number of as equals the number of bs which equals the number of cs. Use a pumping lemma to show that L is not a regular language. (Of course, you can show that the language is not a CFL which implies that it is also not regular) 6. A Queue Automaton (QA) is like a Pushdown Automaton except it has a Queue instead of a