.6 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 (i.e., w=x0101y for some x and y)} d. {ww has length at least 3 and its third symbol is a 0}