Finite-state machine

Given a binary integer, design a finite state machine that read it from "left to right, ie., most significant bit first, and compute its remainder mod 2. For example, for the input "100" the resulting FSM should be in state "0" and for the input "011" the resulting FSM should be in state "l". Note the input can be arn arbitrarily long binary integer. The FSM should use minimal states, and it does not produce any output. Mark the initial state properly. (3 points)