Question: please explain your solution give a state diagram of a...

Please explain your solution.

Give a state diagram of a DFA recognizing the following language.

(a) {w | w contains 0...9}, The alphabet is Σ={0,... ,9}

(b) {w | w is the string ';'}, The alphabet is Σ={;}

(c) {w | w is the string '&&'}, The alphabet is Σ= {&}