rayonnalawrence8652 rayonnalawrence8652 10-01-2024 Engineering contestada Give CFG that generates the language L = {a^n | n = 2k + 1, k ≥ 0}. Is your grammar ambiguous?a) S → aSa | aab) S → aSa | εc) S → aS | aSa | aa d) S → aS | aaS | ε