7. Let L₃ be the language accepted by FA .

(a) Using the algorithm of Kleenes theorem, Lemma 3, Rule 4, construct an FA for the language L₃*

(b) Write the regular expression for L₃ and L₃*

(b) Is the language L₃ the same as the language L₃*? 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 finite automaton