Design deterministic finite automata (DFAs) to recognize the following languages over the alphabet = {x, y}. a. Every occurrence of the substring yy is followed by an x. b. Every third symbol is an x. c. All strings with an even number of x and an even number of y.

Include the transition table with answers.