Given a DFA for the following languages, specified by a transition diagram. For each one of them, give a short and clear description of how the machine works. Assume the alphabet is I = {0,1,2}: (a) L1 = {w w is any string over that contains at least one ?O?.} (b) L2 = {ww contains even number of Os and an odd number of 1s.} (c) L3 = {w=0u12v | u,v are any strings over 2.}