ans all these questions and give all the steps $.$ draw pda in paper $.$

d$)$ Convert the given CFG to GNF$.$

$5$

$SMN$

$M$aMb$||$

$N$aNb$||$

$($Answer any two questions$)$

Prove that the language is a string of $0$ s and $1s$ is context$-$free by designing a PDA

$5$

that accepts it$.$

b$)$ Discuss the relationship between the non$-$terminals, terminals, and stack symbols in a PDA that

$5$

accepts a CFG$.$

c$)$ Show how to convert the $CFG$:$S$ aSb $|SS|$ into an equivalent PDA.