1) Build a DFA (deterministic finite automaton) on alphabet {0, 1} that accepts binary strings where the number of 01 patterns is the same as the number of 10 patterns. Hint: you can do this with 5 states.

2) Find a RE for the language of the machine. The derivation procedure is required.

Subject 1) (50 points) Build a DFA (deterministic finite automaton) on alphabet {0, 1} that accepts binary strings where the number of 01 patterns is the same as the number of 10 patterns. Hint: you can do this with 5 states. 2) (50 points) Find a RE for the language of the machine. The derivation procedure is required