1.6 Give state diagrams of DFAs recognizing the following languages. In all parts the alphabet is 0,1) a. {w| w begins with a 1 and ends with a Oo b, {w| w contains at least three 1s c. {w| w contains the substring 0101, i.e., w = z0101 y for some z and y} d. {w| w 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. swl w doesn't contain the substring 110}