DFA - Design 2

Number of states to design an automaton that accepts 'abbaab' as a substring is

(a)  

A finite-state automaton is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition.

Choose the string accepted by the given automata.

The given automata is a non-deterministic automata.

A finite-state automaton is called a deterministic finite automaton (DFA), if each of its transitions is partially determined by its source state and input symbol, and reading an input symbol is required for each state transition.

The given automata accepts odd number of a's.

Choose the string accepted by the given automaton.

The above automata is

Choose the strings accepted by the given automaton.

Choose the non-deterministic automaton from the list of automata's given below.