You are given two FiniteAutomata $($FA$),$ FAl andFA$2,$ as shown below. On a piece of paper, use the algorithm of Kleene's theorem to construct FA$3,$ the union language FA$1+$ FA$2.$ Then answer the following question:How many final states does FA$3$ have? $($your answer must be a integer number, such as $5!)$