You are given two regular expressions defining two languages L1 and L2 , as shown below. L2 Li (a + b)*a (a + b)*aa(a + b)* You need to find the Finite Automaton that defines the intersection of the two language: L n L2. After obtaining the FA for the intersection language, answer the following question: What letter does the FA read in order for it to loop at its current state? Note: the figure below shows what loops may look like in a FA: a b b a,b a a +1 -1 1 +2 1 b a orb only a only b only a or only b FA1 FA2 FA3 FA4 This operation is not possible because there are no loops. a a and b b a or b O None is correct. No enough information is given to answer this