Please work on the part a), b) and c) of this question! Thank you!

For each of the following languages, draw a transition diagram for a DFA that accepts the language. That is, it accepts all the strings in the language and no other strings. (The alphabet for the DFA is the same as the alphabet for the language.) a) {w e {a,b,c}* | na(w) + n(w) is a multiple of 3} [Note the alphabet!) b) {w e {a,b,c}* | w contains a c and there are no a's after the first c} c) {w E {a, b}* | w contains the string abab}