We give an example of a language L that is not context-free but satisfies the pumping lemma for context-free languages. Let L be the following language: L = {aibkckdk : j, k > 1} u {wick d' : j, k, l>0}. 3. Prove that L satisfies the pumping lemma for CFL's. 4. Prove that L is not context-free. (Hint: Use the property that the intersection of a context-free language and a regular language remains context-free.)