Yes, all finite languages are regular.

Specifically, you can construct a finite automata to represent it.