Finite state automata, multiple completion states?
Your DFA is close, but not quite right. Note that the description requires the strings in the language to have at least one $a$, whereas your DFA will accept the empty string. The fix is simple of course:



And yes, having multiple accept states is fine (in fact, some languages require it).