I need just part b,d and f please

Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is {0, 1}. {w| w begins with a 1 and ends with a 0} {w| w contains at least three 1 s} {w| w contains the substring 0101 (i.e., w = x 0101 y for some x and y)} {w| w has length at least 3 and its third symbol is a 0} {w| w starts with 0 and has odd length, or starts with 1 and has even length} {w| w doesn't contain the substring 110}