Construct a dfa that accepts strings on {$0,1$} if and only if the value of the string, interpreted as
a binary representation of an integer, is zero modulo five. For example, $0101$ and $1111$,
representing the integers $5$ and $15$, respectively, are to be accepted.
