Select a non-regular language, such as L = {a^n b^n | n >= 0}. Write a step-by-step proof using the Pumping Lemma for regular languages to demonstrate that this language cannot be recognized by a Finite Automaton. Clearly define the pumping length p and explain the contradiction that arises when the string is pumped.