(Solved): Give the transition diagram for a DFA for each of the following languages over the alphabet \( \{a ...

Give the transition diagram for a DFA for each of the following languages over the alphabet \( \{a, b\} \) : (a) \( \{w: w \) starts with an \( a \) and ends with a \( b\} \) (b) \( \{w \) : there is exactly one occurrence of the substring \( a a \) in \( w\} \) (c) \( \{w:|w| \) is divisible by 2 but not divisible by 3\( \} \)