I'd like help with parts e) through h)

1. Give a state transition diagram of DFA that recognizes the following language over the alphabet {x,y}: a) Li = the set of all strings that start with x and have odd length b) L2 = the set of all strings that start with y and have even length c) L3 = the set of all strings that end with x and have even length d) Li U L3 e) Li N L2 f) L2 N L3 g) The set of all strings such that every occurrence of x is followed by at least one and at most three ys, .g., , , are in this language, but xxy, , are not. h) The set of all strings that does not contain pattern yxyx