Implement Context-Free Grammar for $L=\{a^n b^m \mid n \neq 2m\}$
Hint: A string of the form $a^nb^m$ where $n \neq 2m$ can be either


A string with too many $a$'s, or
A string with too few $a$'s


Create production rules for each of these cases.