1. (a) Give the regular expression over (a,b] that accepts strings of even length with odd number of a's in it. (5 points) (b) Give the regular expression over fa,b] that accepts strings that have of even length INCLUSIVE OR odd number of a's in it (5 points) 2. Convert 1b into epsilon-NFA (you need to show each step of the NFA - you don't have to follow the algorithms in terms of showing the call stack, just list all the NFAs on the way to the final one) (15 points) 3. Convert this NFA from Question 2 into regex by removing states from it - in each step, write the state that is going to be removed, and the generalized NFA after the state has been removed