Describe the DFA recognizing the given language.

Use the finite automata simulator to test the DFAs: http://web.cs.ucdavis.edu/-doty/automata/simulator.html. Documentation here: http://web.cs.ucdavis.edu/-doty/automata/ 1 mod 5: A -(w 10,1 w is the binary expansion of n EN and n 1 mod 5}. Assume e represents 0 and that leading 0's are allowed. A number n ENis congruent to 1 mod 5 (written n 1 mod 5) if n is ll greater than a multiple of 5, i.e., n-5k+1 for some k e N. For instance, 1, 6, and 11 are congruent to 1 mod 5