Let ∑ = (0, 1). Define the following language:
L = {x | x contains an equal number of occurrences of 01 and 10}
Either prove L is regular (by constructing a DFA/NFA or a regex) or prove that it is not regular using the Pumping Lemma for regular languages.