Hello i am trying to do this exercise of the pumping lemma and i have no idea how to do it need help please.

The exersice is the following:

Use the pumping lemma to prove that the following language is not regular.

L{a^kb^n : k>=2n, and k,n>=0}

Thanks in advance