Give an NFA that accepts exactly the strings over the alphabet {0,1} such that the number of 01 substrings equals the number of 10 substrings. (Exactly means, those string and only those strings. The empty string happens to be such a string, by the way.) Next, give a machine with the fewest number of states. Do not worry if you believe your first answer had the minimum number of states. This is just a problem to come back to later, to see if you can improve your otherwise correct solution. 2. Write a Regular Expression that expresses the same language as the following FSA