Pls solve b!!!

Draw a state diagram of the DFA M = (Q.5,8,90,F). What language does M accept? 2. Construct DFA's to recognize the following languages: (b) {w/w begins with a 0 and has odd length or begins with a 1 and has even length} (e) {wl| w3) (d) {all strings except the empty string}