The question is: Construct a DFA M such that L(M) is the set of all strings over the alphabet {1, 2, 3} whose elements sum to a multiple of 4.
How do you construct a deterministic finite automaton with three inputs 1,2,3 such that the string inputs (ex 1111 or 2222) sums up to a multiple of 4?