For this question consider the language $\{$e$\}$ where e is the empty string $($denoted epsilon in class$).$ From the following select which statement is true.

Question $2$Answer

a$.$

There is only one DFA that recognizes this language: it has two states q$0$ and q$1$ with the following transition function: d$($q$0,0)=$q$1,$ d$($q$0,1)=$q$1,$ d$($q$1,0)=$q$1,$ d$($q$1,1)=$q$1$ and q$0$ is the start state and the only accepting state.

b$.$

There can be infinitely many DFAs that recognize this language.

c$.$

There are finitely many DFAs that recognize this language because this is a finite language.