3. Prove that the following language L2 is regular. The alphabet is = {0, 1}. L2 = {w/w contains an equal number of occurrences of substrings 01 and 10) For example, 010 is in L2 since it has one occurrence of each substring, but 0101 is not in this language since it has two occurrences of 01 but only one occurrence of 10. (10 Points)