Give a CFG that generates the language $\{$a

i

b

k

$|$ i$,$ k $>=0$ and i $=$ k$\}.$ Give the rules of

the CFG and a brief explanation. Your CFG should not be overly complicated.