Draw a deterministic finite automata $($DFA$)$ accepting the language of all strings begining with a $1,$ that when interpreted as a binary integer is a multiple of $5$

Input strings $($accepted$)$: $101,1010,1111,10100,11001,11110,100011$

Input strings $($rejected$)$:$0,1,10,01,11,100,110,000,111,1000,1001,1011,1100,1101,1110$