b) Consider FA (1) and FA (2). Let L1 be the language accepted by FA (1), and let L2 be the language accepted by FA (2). (a) Using the algorithm of Kleene's theorem Lemma 3, Rule 2, construct an FA for the union language L1 + L2. (b) Give an example of a word in the language L1+L2 that is also in both languages L1 and L2. (c) Give a word in the language L1 in L1, but not in L2. L2 that is also (d) Give a word in the language L1 in L2, but not in L1. L2 that is also