From above minimal DFA, describe an equivalent regular expression. Create a new start state (s) and a new final state (f). Show step by step eliminating one state at a time in deriving the regular expression.

i 2 a a a,b 3 b