I want proof of these

Let Σ be an alphabet. (a) Show that every finite set of words over Σ is regular. (b) Are regular languages closed under infinite union? That is, if L0, L1, . . . ⊆ Σ^* are infinitely many regular languages, is n∈N Ln also regular?