Question: Prove Theorem

Theorem 2.6.4 The set of regular languages is closed under the complement and intersection operations: 1. If A is a regular language over the alphabet Y, then the complement is also a regular language. Chapter 2. Finite Automata and Regular Languages 52 2. If Al and A2 are regular languages over the same alphabet E, then the intersection Ain A2 (w E w E A1 and w E A2 is also a regular language