Using the CFL pumping lemma to prove that the following languages are not context free.

(a) {ww, and in w, the number of a 's equals the number of b 's and the number of c 's equals the number of d 's }, where ={a,b,c,d}. For example, adbc and adcdbc are in the language, while adbca is not. (b) {anbncm0mn}