Select the key differences between a deterministic finite automaton $($DFA$)$ and a non$-$deterministic finite automaton $($NFA$).$

Select the key differences between a deterministic finite automaton $($DFA$)$ and a non$-$deterministic finite automaton $($NFA$).$

NFAs are more powerful than DFAs

NFAs can have more than one exiting transition for a state, symbol combination, but DFAs must have exactly one

NFAs can handle larger alphabets than DFAs

NFAs can have epsilon transitions while DFAs cannot