I will upvote for a correct answer that is thorough. Please make sure the answer is correct.

3. (4 points) Is the following language regular. If so, give an NFA that accepts this language and if not, prove why it is not using the pumping lemma. L={an2n1}