3. Describe a FSM that accepts only those binary strings that contain an equal number of substrings 01 and 10. For example 1010 contains 2, 10s and 1, 01 as substring, 010 contains a single occurence of 01 and 10 each.

3. Describe a FSM that accepts only those binary strings that contain an equal number of substrings 01 and 10. For example 1010 contains 2, 10s and 1,01 as substring, 010 contains a single occurence of 01 and 10 each