(a) Draw an NFA that accepts the language {w | there is exactly one block of 1s of odd length}. (A block of 1s is a maximal substring of 1s.)

(b) i. Draw an NFA for the regular expression (010) + (01) + 0. ii. Now using the powerset construction (also called the subset construcion), design a DFA for the same language. Label the states of your DFA with names that are sets of states ofyour NFA. You should use the incremental construction so that you only generate thestates that are reachable form the start state.