Consider the following context-free grammars:G1 : S → aS|B, B → b|bBG2 : S → aA|bB, A → aA|B|ϵ, B → bB|ϵ Which one of the following pairs of languages is generated by G1 and G2, respectively?

• A. {ambn|m > 0 or n > 0} and {ambn|m > 0 and n > 0}
• B. {ambn|m > 0 and n > 0} and {ambn|m > 0 or n ≥ 0}
• C. {ambn|m ≥ 0 or n > 0} and {ambn|m > 0 and n > 0}
• D. {ambn|m ≥ 0 and n > 0} and {ambn|m > 0 or n > 0}