Consider FA1 at the end of the previous page. (a) Using the algorithm of Kleene's theorem, Lemma 3, Rule 4, construct an FA for the language L (b) Is the language L the same as the language Lj? If so, justify your answer wit.h a brief explanation. If not, give an example of a word that is in one language, but not the other b 4 y