Find a CFG for the language defined by aⁿ+b²ⁿ, n=1, 2, 3, ...

Group of answer choices

a) None of the above b) S->aSbbS | a | bb c) S->X | Y, X->aX|a, Y-> bYb | bb d) a*+(bb)* e) S->XY, X->aX|a, Y-> bbY | bb f) S->aSbb | null g) S->aS | bbS | null