L $=\{$ w in $\{$a$,$b$\}*$: w $=$ a$$b$$ where i $=2+$j$,$ j $>=0\}$

Let's say, we have the following four CFGs labeled as $($A$)$ to $($C$).$

CFG A:

S $->$ aaN

N $->$ aNb $|\backslash$epsi

CFG B:

S $->$ aSb $|$ aa

CFG C:

S $->$ aSb $|$ N

N $->$ aaN $|\backslash$epsi

What will be the correct CFG for the language L$?$

Note, for a language L$,$ the CFG will be correct if and only if it can parse all the strings, w in L$,$ and doesn$$t parse any string, w $$ L$.$

$2$ points

A and C

A and B

B and C

A$,$ B and C