Problem $2.(12$ points$)$ Write an FSM that accepts those binary numbers with their number of $0s$ being multiples of three, e$.$g$.,1010110,$ and $11100101($but not $11010,$ nor $001001).$ Draw a graph of your machine and write the formal definition $(S,,,s_0,(F)).$