Consider the following grammar G with S as the start variable:

S$->$Aa$|$bB

A$->$Aa$|$a

B$->$Bb$|\backslash$lambda

Which of the following is TRUE?

Question $2$Answer

L$($aa$)$L$($G$)$

L$($bb$)$L$($G$)$

L$($G$)$ includes every string that consists of a$\text{'}$s only or b$\text{'}$s only.

All of the other answers are true.