I need to find a context-free grammar for the following language which uses the alphabet $\{a, b\}$$$L=\{a^nb^m\mid 2n<m<3n\}$$
Find a context-free grammar for the language $L=\{a^nb^m\mid 2n
formal languages;context free;formal grammars