QUESTION 8 [10] Let Li be the language defined by the regular expression ri, and L2 be the language defined by the regular expression r: Consider FAi that accepts all the words of Li, and FA2 that accepts all the words of L2 By applying Klcene's theorem, build another FA that accepts all the words of the language LiL2 defined by rir Do not formulatc regular expressions as part of your solution A table should be included in your answer (10) FA1 a, b XA +x FA2 ty2