Which of the following is a phrase$-$structure grammar G $=($V$,$ T$,$ S$,$ P$)$ that generates the language L containing all bit strings ending with $1($i$.$e$.,$ all strings composed of $1$s and $0$s but ending with $1)?$None of the choices

$P=\{SA1,AA0,AA1,A\}$

$V=\{0,1,A,S\}$

$T=\{0,1\}$

$P=\{SS1,S0S,S1S,S\}$

$V=\{0,1,S\}$

$T=\{0,1\}$

$P=\{S0S1,S1S1,S\}$

$V=\{0,1,S\}$

$T=\{0,1\}$

$P=\{SB1,BB0,BB1,B1\}$

$V=\{0,1,B,S\}$

$T=\{0,1\}$