Consider the production rules of grammar G:
S → AbB
A → aAb | λ
B → bB | λ
Which language L is generated by G?

1. AL = {aⁿb^m : n ≥ 0, m > n}
2. BL = {aⁿb^m : n ≥ 0, m ≥ 0}
3. CL = {aⁿb^m : n ≥ m}
4. DL = {aⁿb^m : n ≥ m, m > 0}

Pick an option to check yourself, or open the answer below.