The state diagram for the machine that accepts binary strings that represent non-negative integers which are multiples of 5 is shown below. 0 4o 94 92 91 73 Assignment: Explain why the above DFA accepts binary strings representing non-negative integers that are multiples of 5. Showing only examples of strings that are accepted or not accepted is not an acceptable explanation. In particular you must provide a mathematical justification for each transition going from one state to another state as shown in the state diagram. This justification should work for any arbitrary binary string w