. Suppose we have the machine FA1, which accepts the language of all words over the alphabet = {a, b} that have a triple b somewhere in them, and the machine FA2 , which accepts all words that have both an even number of total a's and an even number of total b's (this is the language EVEN-EVEN). Find FA3 that accepts the language defined by the regular expression (FA1 + FA2), (FA2 . FA1), (FA1)*. (C2)