What is meant by pumping lemma for regular languages in Theory of Automata and Formal Languages?

A. a way to remove all terminals B. a method to minimize every CFG C. a tool used to prove some languages are not regular D. a method to encode Turing machines