2 Problem _ Regular and Context-Free Languages Are the following languages context-free or not? If yes, specify a context-free grammar in BNF notation that generates the language. If not, give an informal argument. 1. { anyne I m 0, n 0, o 0} , with alphabet {a, b, c} 2. { anyne I m > n 0, o > 0} , with alphabet {a, b, c} 3. { anbren I n > 0), with alphabet -{a, b, c} 4. { 0a13. n > 0), with alphabet = {0, i} 5, {wwR 1 w E * and wR is w in reverse }, with alphabet ={a, b} 6. { anync"A" | n 0, m > 0 }, with alphabet = {a, b, c, d} 7. { anbrnc"?" I n 0, m 0 }, with alphabet {a, b, c, d} 8. { anyernd" I n 0, m 0 }, with alphabet = {a, b, c, d} 9. { ana"bnbn I n 0 }, with alphabet {a, b} 10. w w has more than 3 symbols), with alphabet -fa, b Which of the languages are also regular languages, i.e., can be expressed by a regular expression? Prove it by giving the regular expression that specifies the language