Design a deterministic finite automaton to accept the set of binary strings that, when interpreted as an integer, is divisible by 5. Note that the most significant digit is the first to be read. Give the five-tuple notation for your automaton, with the transition function expressed as a table. Then, draw the transition diagram for your FA. Think of each state as representing a particular remainder when the number seen so far is divided by to simplify, you may make the reasonable assumption that the empty string represents integer 0, and thus is one of the accepted strings