You are given two Finite Automata (FA), FA1 and FA2, as shown below. We want to use the algorithm of Kleene's theorem to construct a FA3 for the union language: FA1 + FA2. Answer the following questions. What are the two languages defined by the two FAs? Describe the languages using English sentences or regular expressions. What is the maximum possible number of states in the union language defined by FA3? Why? derive the union language FA3. Note: no credit will be given without detailed work. Describe in English or use a regular expression, what is language FA3