the following is a list of statements regarding finite automata. select all statements that are true. group of answer choices one can always convert a nfa with n states to an equivalent dfa with 2n states. one can build a dfa to recognize {13000100∪040013000} while processing an input string, a nfa will accept this string as soon as it reaches an accepting state. a nfa can recognize 0n0n such that n≥0, but a dfa cannot .