(a) Design an nfa with no more than five states for the set {abab": n0} U {aba": n0}. (b) Construct an nfa with three states that accepts the language {ab, abc}*. (c) Find an nfa with for L = {a": n0}U{ba: n1}. (d) Find an nfa with for L = {w E {a, b} (w has both the aa and bb substrings, the order of aa and bb substrings are arbitrary (first aa then bb or first bb then aa substrings can appear in the accepted strings)) U (w does not have the aa substring and does not have the ab substring)} (remember that U means or, so you can apply the union construction which we use in class)