Applying Pumping Lemma


For example, If the is alphabet Σ = {a, b} and the language is L = {a^i+1 b^4i+2|i ∈ N}. How do I use Pumping Lemma to prove that this language is not regular?