Can you please answer this problem about FAs and TGs

Question

an FA with four states was sitting unguarded one night when vandals came and stole an edge labeled with a. what resulted was a TG that accepted exactly the language b*. in the morning the FA was repaired, but the next night the vandals stole an edge labeled with b and what resulted was a TG that acceted a*. the FA was again repaired but this time the vandals stole two edges, one labeled a and one labeled b and the resultant TG accepted the language a* b*. WHAT WAS THE ORIGINAL FA (Finite Automaton)?

if you can't answer it here, just do it in MS Word. then email it to my email address, [e-mail]. Thank you so much and God Bless!!!!

Answer 1

People rarely answer such questions here. :(