Adopt the input alphabet $\{0,1\}$

and consider the following deterministic finite state automaton:

A finite state automaton.

In the list below select the strings that are accepted by this FSA:

Question $1$Select one or more:

a$.$

$110110000$

b$.$

$10100110$

c$.$

$00101001$

d$.$

$01100100$

e$.$

$1101100011$

f$.$

$111111$