Draw FA$3$ that represents FA$1$FA$2$

L$1$: Language with words having at least one letter and the number of b$\text{'}$s divisible by $4.$

Regular expression: $(a+ba*ba*ba*b)+$

FA$1$

L$2$: Language with words that end in a double letter.

Regular expression $(a+b{)}^{*}aa+(a+b{)}^{*}bb$

FA$2$