For each of the problems below, construct a DFA that accepts the given language. You do not need to prove that your submission works, but it is recommended that you at least provide a summary of how your DFA works. This is so the graders do not take off points for DFAs that look different from the ones in the official solutions but still work.
(a) L_{1} = \{ w \in \{0,1\}^{*} \mid w = 001 \}
(b) L_{2} = \{ w \in \{a, b\}^{*} \mid w \text{ has even length} \}
(c) L_{3} = \{ w \in \{0,1\}^{*} \setminus \varepsilon \mid w \text{ when expressed as an integer in binary is divisible by } 5 \}