ASAP

Problem 3 (10 points) Let L be the language generated by the context-free grammar G=(V,,P,S), where: ={a,b,c},V={S}, and P is: SaSbSbc (a) Construct the state diagram of a push down automaton that accepts the language L. If such a push down automaton does not exist, prove it. Answer: (b) Draw a state-transition graph of a deterministic finite automaton that accepts the language L. If such an automaton does not exist, prove it