Give a DFA over $\{a,b\}$ that accepts all striigs containing a total of exactly $4\text{'}$a$\text{'}$s $($and any number of $\text{'}$b$\text{'}$s$).$

Editor

For each state in your automaton, give a brief description of the strings associated with that state.