From the following, select all correct options $($multiple options are correct in this particular question$)$

Question $1$Answer

a$.$

No DFA that accepts the empty language can have accepting states.

b$.$

Consider this two state NFA: d$($q$0,1)=$q$1,$ d$($q$0,0)=$q$1,$ d$($q$1,0)=$q$1,$ d$($q$1,1)=$q$1,$ where d is the "delta" transition function. The state q$1$ is accepting. Then we can say this automaton accepts $\{0,1\}*.$

c$.$

Some NFAs are DFAs as well

d$.$

Since in an NFA we are allowed to select the path a string may follow, strings that do not belong to the language may end up in an accepting state.

e$.$

All DFAs are NFAs, but not the other way around $-$ no NFA can be a DFA.