In an automata or formal-language problem, which option best represents pumping lemma for regular languages?

Correct Answer: B

a tool used to prove some languages are not regular

In this course context, pumping lemma for regular languages means a tool used to prove some languages are not regular.