$(1)$ Create a DFA called $M_1$ that recognizes the @lang of strings of $**\{a{\}}^{\text{'}}s$ and $**\{b\}\text{'}$s having a length of exactly $2.$

$(2)$ Show a logical analysis of the states in M$\_1.$

II