Why is L = {a^ib^i , 0<i<5} regular?

Question

I am trying to understand regular languages. I found this question here https://www.sanfoundry.com/automata-theory-multiple-choice-questions-answers/
Is L = {a^i b^i | 0<i<5} regular?
The answer is yes but I do not get it. Let's take z = a^4^ b^4 , z belongs to L. I can break z into u = a, v= a^3, w= b^4 . I can see that uv^2w = a a^6 b^4 = a^7 b^4 which does not belong to L . By pumping lemma L is not regular.

Do I somehow misuse the theorem ?

Answer 1

Because the set is finite and every finite set can be represented by a regular expression by enumerating its elements.