5. Consider FA (iii) and FA (iv) on the last page of this assignment. Let L3 be the language accepted by FA (iii), and let La be the language accepted by FA (iv). (a) Using the algorithm of Kleene's theorem, Lemma 3, Rule 2, construct an FA for the union language L3 + L4. (b) Give an example of a word in the language L3+Lathat is also in both languages L3 and La. (c) Give a word in the language L3 + La that is also in L3, but not in LA. (d) Give a word in the language L3 + La that is also in LA, but not in L3. finite automaton lab 74 a b. (X3) a 6 X (iv) finite automaton b "a y