DFA that accepts a*b*c* Beginner in DFA related studies, was trying to figure out how to create a DFA with {a,b,c}, that can recognize a * b * c *. 

Appreciate the help.
Here is a possible DFA:



Basically, just send any invalid string like baac, caa*, etc. to a junk state.

As suggested by Yuval Filmus, you can minimize the number of states further by merging $s$ and $a$ :