4) This question is from CS 4110

(i) Build an FA with three states that accepts all strings. The question does not specify an alphabet so lets say it is { a b c } (ii) Show that given any FA with three states and three + 's, it accepts all input strings.

(iii) If an FA has three states and only one + , must it reject some inputs?

Please make sure it is legible.