Let a language L be the set of strings over alphabet {0, 1, 2} that do not have two consecutive identical symbols. That is, strings of L are any string in {0,1,2}* such that there is no occurrence of 00, no occurrence of 11, and no occurrence of 22. Design a DFA (transition table or transition diagram -- your choice) that accepts L.