Draw the state diagram of DFA recognizing the following language B$.$ The alphabet is $\backslash$Sigma $=\{$a$,$ b$,$ c$\}.$

B $=\{$w $|$ the symbols in w are in alphabetical order$\}$

For example, aaabcc in B$,$ ac in B$,$ but abca $$ B$.$