(2 pts) Design a context-free grammar (CFG) for the language
L
over the alphabet
\Sigma ={a,b}
such that
consists of all strings where the number of
a
's is twice the number of
b
's.
