Convert the following DFA to a regular expression. That is, what is a regular expression for the language accepted by this machine? Remove states in the following order: state C, then B, then D, then finally A. At each removal of a state, draw the relevant diagram, showing the regular expression that transition from state to state. For example, after removing state C, there should be five states with two e-transitions, four transitions on a single character, and one transition with the regular expression 0|10* 1. 0 start A B C 0 As part of your solution, provide an explanation of the process. Specifically, for at least one of the states that you eliminate, provide a detailed explanation