$(1)$ Create a DFA called M$\_1$ that recognizes the elang of strings of $**\{a{\}}^{\text{'}}s$ and $**\{b{\}}^{\text{'}}s$ having a of exactly $2.$ II

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