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. { am p | m > 0, n 200 > 0}, with alphabet Y = {a, b, c} 2. { a" " c |m > n 20, 0 > 0}, with alphabet = {a, b, c} 3. { a"U" " | n > 0} , with alphabet E = {a, b, c} 4. { 02n13n | n 20}, with alphabet = {0, 1} 5. { wwR | we n* and wP is w in reverse }, with alphabet E ={a, b} 6. { a"B"Cmdn | n 2 0, m 20}, with alphabet E = {a, b, c, d} 7. { af""an |n > 0, m 2 0 }, with alphabet E = {a, b, C, d} 8. { anU Mdm |n > 0, m 20}, with alphabet . E = {a, b, c, d} 9. { ana aff |n 20}, with alphabet E = {a, b} 10. { ww has more than 3 symbols}, with alphabet D={a, b} Which of the languages are also regular languages, ie, can be expressed by a regular Expression? Prove it by giving the regular expression that specifies the language