Can you please solve this using Latex form? Thanks alot!

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 0} b. (w w contains at least three 1s} C{w/w contains the substring 0101 (i.e., w = r0101y for some x and y)} d. {w w has length at least 3 and its third symbol is a 0} e.) {wl w starts with O and has odd length, or starts with 1 and has even length} F. {w/ w doesn't contain the substring 110} g. {w the length of w is at most 5} h. {wl w is any string except 11 and 111} i. {w every odd position of w is a 1} j.){wl w contains at least two Os and at most one 1} k. {,0} 1. {w w contains an even number of Os, or contains exactly two 1s} m. The empty set n. All strings except the empty string