Finite Automata Construction question:

Q3. a X2 X1 FA1 a,b b Y2 + Y3 Y1 FA2 Using the algorithm given during the proof of Kleene's theorem, construct FA3 for the product language (FA1.FA2). Show all of the steps in obtaining the new Z states and draw the state transition diagram for FA3. (Kleene's teoremin ispat srasnda verilen yntemi kullanarak, FAL.FA2 arpm diline karlk gelen FA3' oluturunuz. Yeni Z durumlarnn elde edilmesine ilikin tm admlar gsteriniz ve F23 iin durum gei diyagramn iziniz.)