Using the CFG to PDA conversion method discussed in class. we convert a context$-$free grammar G into a $3-$state PDA M$.$ Suppose we modify M by switching its final and non$-$final states, and call the resulting PDA as M$.$ Which of the following statements is TRUE about L$($M$)?$

Question $3$Answer

a$.$

L$($M$)$L$($M$).$

b$.$

Prefix$($L$($M$))$L$($M$).$

c$.$

L$($M$)$ is the complement of L$($M$).$

d$.$

Prefix$($L$($M$))$L$($M$).$