7. Let L3 be the language accepted by FA (iii) on the last page of this assignment.

1. (a) Using the algorithm of Kleenes theorem, Lemma 3, Rule 4, construct an FA for the language L3*
2. (b) Is the language L3 the same as the language L3*? If so, justify your answer with a brief explanation. If not, give an example of a word that is in one language, but not the other.

finite automaton a, b 74 b a b X2 oi (x a b X finite automaton 79*