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