$==$Required information

NOTE: This is a multi$-$part question. Once an answer is submitted, you will be unable to return to this part.

Let $G=(V,T,S,P)$ be the phrase$-$structure grammar with $V=\{0,1,A,S\},T=\{0,1\}$ and a set of productions $P$ consisting of $S$

$1S,S00A,A0A,$ and $A0.$

Identify the correct set representing the language generated by $G.$

Multiple Choice

$\{\begin{array}{c}{1}^n{0}^m|n3\end{array}$ and $\{$:$m1\}$

$\{\begin{array}{c}{1}^{n}0m|n0\end{array}$ and $\{$:$m3\}$

$\{\begin{array}{c}{11}^n{0}^m|n1\end{array}$ and $\{$:$m3\}$

$\{\begin{array}{c}{10}^{n}m|n1\end{array}$ and $\{$:$m1\}$