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={a"bnc' | i n and i, n 0 } > 0 c) L = { uruRu, I u, is a string of 0s and 1s }