You are given two Finite Automata $($FA$),$ FA$1$ and FA$2,$ as shown below.

a

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:

In FA$3,$ how many states have direct loops? In other words, how states have transitions

directly moving back to themselves? $($your answer must be a integer number, such as $5!)$