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. {a^nb^mc^o | m > 0, n greaterthanorequalto 0, o > 0}, with alphabet sigma = {a, b, c} {a^nb^mc^o | m > n greaterthanorequalto 0. o > 0}, with alphabet sigma = {a, b, c} {a^nb^nc^n | n > 0}, with alphabet sigma = {a, b, c} {a^2nb^3n | n greaterthanorequalto 0}, with alphabet sigma = {a, b} {ww^R | w elementof sigma* and w^R is w in reverse}, with alphabet sigma ={a, b} {a^nb^mc^md^n | n greaterthanorequalto 0, m greaterthanorequalto 0}, with alphabet sigma = {a, b, c, d} {a^nb^mc^nd^m | n greaterthanorequalto 0, m greaterthanorequalto 0}. with alphabet sigma = {a, b, c, d} {a^nb^nc^md^m | n greaterthanorequalto 0, m greaterthanorequalto 0}, with alphabet sigma = {a, b, c, d} {a^na^nb^nb^n | n greaterthanorequalto 0}, with alphabet sigma = {a, b} {w | w has more than 5 symbols}, with alphabet sigma={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 specifics the language