Please provide me step with step and detailed solution

Question 6 (12): The nondeterministic finite automata illustrated below are defined over the alphabet ? = {a,b). By using the method shown in the lectures, transform them, so to obtain their corresponding regular expressions. Show your working. b a,b a 91 93 a b a 91 92 b 92 b Note: the order in which you remove states in the conversion process will greatly affect the complexity of the resulting regular expression. Try to choose this order in a way that creates the simplest result. You might want to try multiple options before deciding which one to use for your submission (diagrams are on next page)