State and prove the Pumping lemma for the regular languages. How can you show with example that pumping lemma is used to prove that a given language is not regular? Explain.