Explain the Pumping Lemma for regular languages. Demonstrate how to use it as a proof tool to show theoretically that a specific language (e.g., L = {0^n 1^n | n >= 0}) is not regular. Detail the process of choosing a string 's' in the language and deriving a contradiction.