You are given two regular expressions defining two languages L1 and L2, as shown below:

L1 = (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 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?

a) This operation is not possible because there are no loops

b) b

c) a and b

d) none is correct

e) a or b

f) a

g) Not enough information is give to answer this question

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: Lin 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? This operation is not possible because there are no loops. O a and b None is correct. a orb No enough information is given to answer this