Consider the following incomplete DFA.
What will be the transitions of state D such that automata will accept the set of all binary strings containing $010$ as sub-string ?
- $d (D,0)=A$ $d (D,1)=D$
- $d (D,0)=C$ $d (D,1)=B$
- $d (D,0)=D$ $d (D,1)=B$
- $d (D,0)=D$ $d (D,1)=D$