CAN SOMEONE PLEASE EXPLAIN AND DRAW THIS PROPERLYDesign a Finite State Automaton $($FSA$)$ that accepts binary numbers greater than $0,$ whose

decimal equivalents are divisible by $5.$ For instance, the FSA should accept inputs like $\text{'}1010\text{'}$

$($decimal equivalent: $10),$ and $\text{'}101\text{'}($decimal equivalent: $5),$ but it rejects inputs like $\text{'}1101\text{'}$

$($decimal equivalent: $13)$ and $\text{'}1001\text{'}($decimal equivalent: $9).[4$ marks$]$