Convert the following DFA into an equivalent regular expression. A is the start state and {B} is the set of final states.
Input Symbol
State 0 1
A A B
B B A