B)Consider FA (1) and FA (2). Let L1be the language accepted by FA (1), and let L2be the language accepted by FA (2).(a) Using the algorithm of Kleene’s theorem, Lemma 3, Rule 2, construct an FAfor the union language L1+ L2.(b) Give an example of a word in the language L1+L2that is also in both languagesL1and L2.(c) Give a word in the language L1+ L2that is also in L1, but not in L2.(d) Give a word in the language L1+ L2that is also in L2, but not in L1.