Design a DFA to recognize the following languages over the alphabet (0, 1). Each one is worth 5 points: a. wl w begins with a 1 and ends with a o) b. w w contains at least three 1s) c. {ul w contains the substring 0101 (i.e., w = zololy for some x and y)} d. wl w has length at least 3 and its third symbol is a o) e. w w starts with 0 and has odd length, or starts with 1 and has even length) f. { w doesn't contain the substring 110} g. ful the length of w is at h. {wl w is any string except 11 and 111) i. sul every odd position of w is a 1) j. {wl w contains at least two Os and at most one 1) most 5)