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