Computational theory. Instant thumbs up for correct answer please do both parts

Q. I Maximum score 40 (20 for each part) is odd). We want to find a regular expression for the language L (w Cla,bi n(w) is even and (w) n attempt to construct a regular expression directly from this description will lead to all kind of difficulties. Instead, use the following approach. (a) Find a NFA for the language. (Hint: Use four states: EE to denote an even number of a's and b's O0 to denote odd number of a's and b's,OE to denote an odd number of a's and even number of b's, and EO, even number of a's and odd number of b's). EE is the starting state and final state EO. (b) Convert this NFA to a regular expression by removing one state at a time (e.g. state 00 and then state OE Then write down the regular expression