All finite languages can be decribed using a regular expression?
Suppose that a finite language consists of words $w_1, w_2, \dots, w_n$.

Then what do you think the regular expression ^(w1 | w2 | ... | wn)$ matches?