(1) Prove the following language is not regular, using the pumping lemma for regular languages.

L = { na(w) + 2 <= nb(w): w ε {a, b}*}