I Need help with Finite Automata HW

1. (10 pts.) Draw the state diagram for a DFA that accepts binary strings representing integers divisible by 5 (leading 0's are allowed). 2. (10 pts.) Draw the state diagram for an NFA that accepts binary strings containing an even number of o's or containing exactly two 1's. 3. (10 pts.) Convert the following NFA to an equivalent DFA: 4