(1) For each of the following languages, say whether it is context-free. If so, write a CFG or draw a PDA (non-mathematically) that generates the language. If not, prove it using the pumping lemma...

Multiple Upvotes are waiting for your solution
0}. L = {amb"c{m-n) | m > n} {amb"cm" | m, n 2 0} L = {a"b" cm | m > n} L "/>
Extracted text: (1) For each of the following languages, say whether it is context-free. If so, write a CFG or draw a PDA (non-mathematically) that generates the language. If not, prove it using the pumping lemma and/or closure properties for CFLS. (a) (b) (c) (d) L = {a" | n > 0}. L = {amb"c{m-n) | m > n} {amb"cm" | m, n 2 0} L = {a"b" cm | m > n} L