Let sigma = {0, 1}, and let D = {w | w contains an equal number of occurrences of the substrings 01 and 10} Thus 101 elementof D because 101 contains a single 01 and a single 10, but 1010 D because 1010 contains two 10s and one 01. Prove that D is a regular language