3.Construct a DFA equivalent to the following NFA: (20 pts) ({qo, q1}, {0, 1}, 81, qo, {q1}) The above shows (the set of states, the alphabet, the transition function, the initial state, the final state). 81: 1 qo, q1 9o, q1 qo go qi qi Try two strings that are accepted by both finite automata.