You are given two regular expressions defining two languages Li 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 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 jump to the start state? a orb O None is correct. This operation is not possible. O No enough information is given to answer this question. O a and b