Using the pumping lemma for CFLs, show that the following languages are not context free:

a) L = { a^n b^n c^i | i = 0 }

b) L = { a^n b^n c^i | n = 0 }

c) L = { w w^R w | w is a string of 0s and 1s }

3. (18 points) (from Exercise 7.2.1: parts (b), (e) and (f) Using the pumping lemma for CFLs, show that the following languages are not context- free: a) L -abd | i