In constructing a PDA M that accepts a language described by a CFG G$,$ G must be:

$*$

$1$ in Chomsky Normal Form

$2$ in Greibach Normal Form

$3$ none of the mentioned

$4$ simplified