Identify the language generated by the following grammar, where S is the start variable.S → XYX → aX | aY → aYb | ϵ

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