Ashesnwine7518 Ashesnwine7518 14-02-2024 Engineering contestada Convert the following DFA into an equivalent regular expression. A is the start state and {B} is the set of final states. Input SymbolState 0 1A A BB B A