You are given two regular expressions defining two languages L1 and L2, as shown below. We want to find the Finite Automaton that defines the intersection of the two language: L1 n L2. Answer the following questions L1: (a + b)'a L2: (a + b)*aa(a + b)* draw the two FAs defining Li and L2 draw the two FAs defining the complement languages for Li and L2. derive the FA for the union language of the two complement languages for L and L2. Note: no credit will be given without detailed work. derive and draw the FA for the intersection of L1 and L2. Describe in English or use a regular expression, what is the language for the intersection of L1 and L2