Please explain how you got the answer, thanks

Let = {a}. For each of the following languages, either prove that it is regular (by exhibiting one of: DFA, NFA, regular expression, or regular grammar), or prove that it is not regular using the pumping lemma. (a) L a2018n : n 20) (b) L2 018" : n 0}