Give a DFA that recognizes all ternary sequences of 0s and 1s and 2's that evaluate to a value 1 mod 5, or, 4 mod 5, as a ternary number.

(A DFA has a arrow coming out of every state for each of the symbols in the alphabet: 0,1,2)

(A ternary number such as 210 evaluates to 23² + 13¹ + 03⁰ = 21)

ex)

1 mod 5	Decimal	1	6	11	16	21	26
	Ternary	1	20	102	121	210	222	Accept these string
4 mod 5	Decimal	4	9	14	19	24	29
	Ternary	11	100	112	201	220	1002	Accept these strings