Make an automaton that accepts the language L over alphabet = {0, 1, 2} such that a word is in L only if it has an odd number of 0s, an even number of 1s, an odd number of 2s. Tabulate and draw the state diagram of your automaton. (indicate the initial and the final states.)