You are given two Finite Automata (FA), FA1 and FA2, as shown below.

You need to use the algorithm of Kleenes theorem to construct a FA3 for the union language: FA1 + FA2. After constructing FA3, you need to answer the following question: What language does FA3 define? Choose all that apply.

1) (a+b)*(ab)(a+b)*a

2) a language of any string that ends in "a" and has "aa" in it.

3) a finite language

4) an infinite language

5) a language of any string that ends in "a" and has "ab" in it.

6) (a+b)*(aa)(a+b)*a

7) An empty language

8) (a+b)*a + (a+b)*ab(a+b)*

9) (a+b)*a + (a+b)*aa(a+b)*

10) a language of any string that ends in "a" or has "ab" in it.

& 88-8- w- W2+ 12 FA2 FA1 & 88-8- w- W2+ 12 FA2 FA1