$(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.$

Show a logical analysis of the states

Is this correct??

$($Needs to be in this formula. $)$