3.Construct a DFA equivalent to the following NFA: (20 pts) The above shows (the set of states, the alphabet, the transition function, the initial state, the final state) 0 g 990-91 Try two strings that are accepted by both finite automata