Design a DFA Accepting Binary Ints Divisible by n

When you divide an integer by $n$, you get a remainder which is between $0\dots (n-1)$. Each one of these states need to be captured so our FA will have $n$ states.

Only $0$ is a final state.

We want to make a table displaying the binary numbers of the digits $1\dots (n-1)$ where each one of these numbers will have its own state. Using the binary numbers we can define transitions in between states.

Fill in the remaining transition so each state has a 0,1 transition by writing out more binaries (binaries over $n$) and draw their transitions on the DFA.