1. Provide a DFA that accepts the following languages over the alphabet [0, 1]: a. The set of all strings with an even number of Os. (5 points) b. The set of all strings that start with the prefix 101 and contain the string 000. (5 points) c. The set of all strings beginning with 1 that, when interpreted as a binary integer, is a multiple of 5. For example: 101 and 1010 are in the language, but O and 111 are not. (10 points)