D$.(4$ pts$)$ Let L$($G$)=\{($bb$)$nb$($aa$)$n$|$n in Z$,$ n $>=0\},$ where $\{$a$,$ b$\}$ is the set

of terminal symbols.

$25.$ Which set of production rules for G with start symbol S $($a non$-$

terminal$)$ can generate it$?$

A$.$ S $->$ baSab, S $->$ b

B$.$ S $->$ aaSbb, S $->$ b

C$.$ S $->$ bAa, A $->$ bSa, S $->$ b

D$.$ S $->$ aAb, A $->$ aSb, S $->$ b

E$.$ S $->$ bSa, A $->$ bAa, S $->$ b

$26.$ Identify the most specific type of grammar that G can be classified as$.$

A$.$ Type$-0($no restriction on production rule$)$

B$.$ Type$-1($context$-$sensitive$)$

C$.$ Type$-2($context$-$free$)$

D$.$ Type$-3($regular$)$

E$.$ None of the above