$[10$ points.$]$

$($a$)$ Construct a deterministic finite$-$sate automaton that recognizes the set of bit

strings that have neither two consecutive $0$ s nor two consecutive $1$ s$,$

$($b$)$ Find the language recognized by the following finite$-$state automaton