You are given two regular expressions defining two languages L1 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: L1 n L2. After obtaining the FA for the intersection language, answer the following question: How many states does the FA for the intersection language have? How many final states does the FA for the intersection language have