Give the state diagrams for the DFA$$s that accept the following languages:

$)\{$x$|$x is a binary string which contains an even number of $1$s and ends

in $010\}($Hint: language operations$)$