Let L1, L2 C * be regular languages. Prove (or disprove) that the following languages obtained from L and L2 are regular. 1. Complement: L1 = {w\w & L1}. 2. Intersection: Lin L2 = {w/w L1, W E L2}. 3. Difference: L1 - L2 = {wwe L1, w & L2}. 4. Exclusive-or: L1 L2 = {ww E L U L2,w & Lin L2}