Give the state diagram of a DFA that recognizes the language of $L$ over alphabet $.($Drawn on paper$)$

$=\{a,b\},L=\{w|w=a^n{b}^m,$ where $n+m=3\}$