(a) (3pts) Construct an NFA that accepts binary strings over alphabet {x,y} that have y as the second-to-last symbol. (b) (8pts) Give the state diagrams of NFAs with the specified number of states recognizing each of the following languages. The alphabet is {x,y}. - L8={ww contains the substring yxyx} (5 states or less) - L9={ww contains an even number of xs or contains exactly two ys} (6 states or less) (c) (7pts) Convert the following NFA to a DFA. Show your work for full credit