An NFA over the alphabet {0,1} was constructed to accept strings with an even number of occurrences of the substring '01'. This NFA was then converted to an equivalent DFA. Only the reachable portion of the DFA state diagram from the start state is shown.