The pumping lemma for regular languages states that:

A$.$ Every regular language can be pumped to generate an infinite number of strings

B$.$ Every regular language can be pumped to generate a finite number of strings

C$.$ Every regular language can be pumped to generate longer strings

D$.$ Every regular language can be pumped to generate shorter strings