I)Let D = {w| w contains an even number of as and an odd number of bs and does not contain the substring ab}. Give a DFA with five states that recognizes D and a regular expression that generates D. (Suggestion: Describe D more simply.)

ii)Suppose you constructed this DFA by rst analyzing D as built up from simpler languages. How many states would the resulting DFA have? Explain

I got 1, I need answer for 2nd part.