Mark all that apply by writing either $T($for true$)$ or $F($for false$)$ in the blank box before each

statement. Let $A,B,C,$ and $D$ denote nonterminals, and let $a,b,c,$ and $d$ denote terminals.

Which of the following grammars describe the language $\{a^l{b}^l{c}^m{d}^n{b}^n|l,m,$ninN$\}?$ NB:

the grammar root is always $S,$ and zero is a natural number $(0$inN$).$

$S$::$=A,A$::$=bA|B,B$::$=dB|C,C$::$=$CcA$|D,D$::$=aD|.$

$S$::$=A,A$::$=aA|B,B$::$=bDd|C,C$::$=Cc|,D$::$=bBd|C.$

$S$::$=AC,A$::$=$aAb$|,B$::$=bBd|,C$::$=cC|B.$

$S$::$=AC,A$::$=Ac|B,B$::$=$aBb$|,C$::$=bCd|.$

$S$::$=$ABC,$A$::$=$aAb$|,B$::$=cB|,C$::$=bCd|.$

$S$::$=$ABC,$A$::$=Ac|,B$::$=bBd|C,C$::$=cC|.$