A 1 0 1 0 0 0 1 0 0 1 0 M)For each DFA, construct anequivalent DFA with the minimum number of states. Show yourwork.

A 1 0 1 0 0 0 1 0 0 1 0 M) Show transcribed image text