ASAP

Problem 2 ( 10 points) Let L be the language accepted by the pushdown automaton: where: M=(Q,,,,q,F) and the transition function is defied Qy={q,r,s,t}={a,b,c}={$}F={q} ansition function is defined by the following state diagram: (Recall that M is defined so as to accept by final state and empty stack.) (a) Write 3 distinct strings that belong to L. If such strings do not exist, prove it. Answer: (b) Give a context free grammar G that generates L. If such a grammar does not exist, prove it. Answer: (c) Give a regular expression that represents L. If such an expression does not exist, prove it