Write a context-free grammar for each set below. (14 points)

{vv

^{R}ww^{R }| v∈{a,b}*, w∈{a,b}*} [w^{R}indicates w-reversed]{ a

^{m}b^{m+n}c^{n}| m,n ≥ 0 }{a

^{m}b^{n}| 2m = n or m = 2n }01{0

^{n}10^{n+1}1}*{ a

^{k}b^{l}a^{m}b^{n}| k = m or l = n }The set of all strings of a's and b's

*not*of the form ww. [Hint: For even-length strings, there have to be two characters that disagree; think about what the rest of the string looks like.]The set of all strings

*not*in { a^{n}b^{n}c^{n}| n≥1 }.

Exercise 5.1.4 [Right-linear CFG = regular] (4 points)