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. I. { anyne I m 0, n 0, o 0, with alphabet {a, b, c} 2. { anunCo I m n-0. o 0} , with alphabet -{a, b. c} 3. { anyja I n 0} . with alphabet -ta, b. c} 4. { 02n 13m 1 n 0 }, with alphabet -10, 1} 5. { wwR I 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. { anync"d" | n > 0, m > 0 }, with alphabet {a, b, c, d} 8. { anyernd" | n 0, m 0 }, with alphabet, -{a, b, c, d} 9. { ananb n I n > 0 }, with alphabet -{a, b} 10. { w w has more than 3 symbols), with alphabet 2-Ta, b] Which of the languages are also regular langua expression? Prove it by giving the regular expression that specifies the language. ges, i.e., can be expressed by a regular