Show that the family of regular languages is closed under finite union and intersection, that is if L_1, L₂ ..., L_n are regular, then:

L_U = i = {1,2,...,n} U L_i

and

L_I = i = {1,2,3,...,n} INTERSECT L_i

Are also regular.