Please answer all questions!

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. {anbmcom>0,n0,o>0}, with alphabet ={a,b,c} 2. {anbncnn>0}, with alphabet ={a,b,c} 3. {02n14nn0}, with alphabet ={0,1} 4. {wcwRw and wR is w in reverse }, with alphabet ={a,b,c} 5. {anbmcmdnn0,m0}, with alphabet ={a,b,c,d} 6. {anbmcndmn0,m0}, with alphabet ={a,b,c,d} 7. {ananbnbnn0}, with alphabet ={a,b} 8. {ww has more than 3 symbols }, with alphabet ={a,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