Consider the following context – free grammars:
G1 : S → aS|B, B → b|bB
G2 : S → aA|bB, A → aA|B|ϵ, B → bB|ϵ
Which one of the following pairs of languages is generated by G1 and G2, respectively?1
{am bn│m > 0 or n > 0} and {am bn│m > 0 and n > 0}
2
{am bn│m > 0 and n > 0} and {am bn│m > 0 or n ≥ 0}
3
{am bn│m ≥ 0 or n > 0} and {am bn│m > 0 and n > 0}
4
{am bn│m ≥ 0 and n > 0} and {am bn│m > 0 or n > 0}