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

particular question$)$

a$.$ 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.

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

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

d$.$ Some NFAs are DFAs as well

e$.$ Consider this two state NFA: $d(q0,1)=q1,d(q0,0)=q1,d(q1,0)=q1,d(q1,1)=q1,$

where $d$ is the "delta" transition function. The state $q1$ is accepting. Then we can

say this automaton accepts $\{0,1{\}}^{**}.$