Question 7 40 points Save Answer Plese use '+' for union Given the DFA with the transition function below, where A is the initial state and C is the final state, the equivalent regular expression is and '*' for closure along with paranthesis symbols '(',')', 'T', 'y' for disambiguation. (0,2)-> 1 A . B B c C 2. B B C