$14\mathrm{.}2$ Size of a DFA for a Language

There is a three$-$state DFA, with input alphabet $\backslash$Sigma $=\{$a$,$ b$\},$ whose language is the regular language a$\backslash$Sigma $*$b true or false