You are given two regular expressions defining two languages Li and L2 , as shown below. Li = (a + b)* a L2 = (a + b)* aa(a+b)* You need to find the Finite Automaton that defines the intersection of the two language: Lin L2. After obtaining the FA for the intersection language, answer the following question: What language does the FA define? Choose all that apply. a finite language a language of any string that ends in "a" or has "aa" in it. (a+b)*aa(null+(a+b)*a) a language of any string that has "aa" in it. (a+b)*aa(a+b)* an infinite language (a+b)*aa(a+b)*a+(a+b)*aa a language of any string that ends in "a" and has "aa" in it. a language of any string that has "aaa" in it. (a+b)*aa(a+b)*a