Design a finite state machine that accepts binary strings divisible by 4. Input is fed to the FSM one bit at a time, from the most significant bit to the least significant bit (left to right), the same way we showed in class. For example, 1000 should be accepted, but 1010 should be rejected. Clearly explain how you designed your state transitions. Showing the FSM alone is worth minimal or no credit!