$(1)$ Create a DFA called M$\_1$ that recognizes the @lang of strings of $*\{$a$\}$s and $*\{$b$\}$s having a length of $2.//$ Show a logical analysis of the states in M$\_1.//$