Regular language proving
Every finite language is regular. The easiest way to prove it is to build the regular expression $w_1+w_2+\dots+w_n$ where $\{w_1,\dots,w_n\}$ is you finite language.

You can also build an automaton as you said. May be build a separate one  for each word and the do a finite union is the easiest.