The pumping lemma is often used to prove that a language is:

• A. Context free
• B. Not context free
• C. Regular
• D. None of the mentioned