Let the following transition tables for FA1, and FA2 FA1 State -X1 X2 +X3 a X2 X3 X3 b X1 X1 X3 State -Y1 Y2 Y3 +Y4 FA2 a Y1 Y2 Y3 Y4 b Y2 Y3 Y4 WN KR a) Use tables to draw FA1, and FA2. b) Describe FA2 in English phrases c) Use Kleen's theorem steps for finding FA3 that accepts the language defined by the regular expression (r1+r2)