1. (10 points) The XOR of two languages L1, L2 is defined as the set {s E {* such that . SEL1 but s L2 or . SE L2 buts L1 }. Prove that if L1 and L2 are regular, then L1 XOR L2 is also regular. If your proof involves the construction of a finite automaton, make sure your proof includes an argument about the acceptance of strings in L1 XOR L2 and the non-acceptance of strings not in L1 XOR L2