Draw the state transition diagram of the given NFAs. Convert it to a equivalent DFA, and give the transition diagram. Give the language accepted by the automata as a regular ex pression 5+5) ,91,92 F 192