Please help me draw a DFA that accpets the binary number divisible by 5. My professor said that I can sovle the problem as written in upside for reference. Sorry for

my poor english!!! Have a nice day ;-)))

3 Safari 211:15 x hw1-1.JPG L3w w in 0,1)* and w, viewed as a binary integer is divisible by 23) If string w represents integer i, then assume ?(0, w)-19023. Then w0 represents integer 2i, so we Want 6(1% 23, 0)-(2)9023. Similarly: w1 represents 2i+1, so we Want ?(1%23, 1) = (2+1)%23. Example:6(15,0)-309023-7; 6(11,1) = 23%23 = 0. : design a DFA by figuring out what each state needs to remember about the past. ? ???? 5? ??? ???? ???? ???? DFA? ?? ??? ?.(? ??? ???? ??? ?????)