1. Give a CFG for each of the following languages (with n, m, k ≥ 0.)
Note: You only need to give production rules for each grammar.
(a) L = {a^n b^2n | n ≥ 2}
(b) L = {w ∈ {a, b}* | na(w) = 3nb(w)}.
(c) L = {wwR | w ∈ {a, b}*}
(d) L = {w ∈ {a, b}* | w = wR, that is, w is a palindrome. }
(e) L = {a^n b^m | n ≥ m + 3}.
(f) L = {a^n b^m | n < m + 3}.
(g) L = {a^m b^n c^k | m = n + k}.
(h) L = {a^m b^n c^k | n = k + m}.
(i) L = {a^m b^n c^k | n = m + 2k}.
(j) L = {w ∈ {a, b, c}* | na(w) + 2nb(w) ≠ nc(w)}.
(k) L = {a^m b^n c^k | m > n or n + m = k}.