Consider the two FAs

(a) Using the algorithm of Kleenes theorem, Lemma 3, Rule 2, construct an FA for the union language FA1 + FA2.

(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 + L2 that is also in L1, but not in L2.

(d) Give a word in the language L1 + L2 that is also in L2, but not in L1.

b 4 y