Give the state diagrams of NFAs with the specified number of states recognizing each of the following languages. The alphabet is {x, y}.

L8 = {w| w contains the substring yxyx} (5 states or less)

L9 = {w| w contains an even number of x's or contains exactly two y's} (6 states or less)