Draw the transition diagram for a five-state DFA that recognizes the language of all binary strings representing multiples of five, i.e., the language L containing , 101, 1010, 1111, 10100 etc., and all strings obtained from these by adding leading 0's. Hint: Look back at Problem 5.]