2. Use the state elimination algorithm (eliminate state A first, then B, then C) to find the REGULAR EXPRESSION for the language described by DFSA M = ({A,B,C}, {0,1}, ?, A, {A,B}), where ? is defined as follows. Show steps and do not simply your result.

? 0 1

A A B

B C B

C A B