Give a DFA for the following language over the alphabet = {0, 1, 2}: L={ w | the sum of the symbols in w is a multiple of 3} For example, 021201 is part of the language because the sum of all its symbols equals 6 (6 mod 3 = 0); whereas, 010012 is not in the language because it sums up to 4 (4 mod 3 = 1).