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 = {&}