Give a production grammar that specified language L = {ai b2i >= 1}.
(a) {S->aSbb,S->abb}
(b) {S->aSb, S->b}
(c) {S->aA,S->b,A->b}
(d) None of the mentioned
The question was posed to me during an online interview.
Asked question is from Regular Grammar topic in division Contextfree Grammar and Syntax Analysis of Compiler