(Solved):   5) Give state diagrams of DFAs recognizing the following languages. In all parts the alpha ...

 

5) Give state diagrams of DFAs recognizing the following languages. In all parts the alphabet is \( \{0,1\} \) a. \( \{\mathrm{w} \mid \mathrm{w} \) begins with a 1 and ends with a 0\( \} \) b. \( \{\mathrm{w} \mid \mathrm{w} \) contains at least three \( 1 \mathrm{~s}\} \) c. \( \{\mathrm{w} \mid \mathrm{w} \) contains the substring 0101\( \} \) d. \( \{\mathrm{w} \mid \mathrm{w} \) has length at least 3 and its third symbol is a 0\( \} \) e. \{w \( \mid \) w starts with 0 and has odd length, or starts with 1 and has even length \( \} \mathrm{f} \). \( \{\mathrm{w} \mid \mathrm{w} \) doesn't contain the substring 110\( \} \) g. \( \{\mathrm{w} \mid \) the length of \( w \) is at most 5\( \} \) h. \( \{\mathrm{w} \mid \mathrm{w} \) is any string except 11 and 111\( \} \) i. \( \{\mathrm{w} \mid \) every odd position of \( w \) is a 1\( \} \)