q$\mathrm{.}2.$ An Example of DFA which accepts all strings

over $\{1,0\}$ of length $2.$

q$\mathrm{.}3.$ Show with the state diagram if the above DFA

machine will except the following strings.

$\{10\}$

$\{100\}$