Give the state diagrams for the DFA$$s that accept the following languages: a$)(4$ points$)\{$x$|$x is a binary string, which, when interpreted as a binary number, is equivalent to $3$ mod $6\}$ b$)(4$ points$)\{$x$|$x is a binary string which contains an even number of $1$s and ends in $010\}($Hint: language operations$)\backslash$