Convert the following finite state machine to an equivalent regular expression. The alphabet is {0,1}. Derive the regular expression from the finite state machine by removing the states in this sequence: remove A, then B, then c, and then D. After removal of each state, show the resultant generalized NFA as a state diagram with each transition labeled by an appropriate regular expression. Initially, be sure to add a new start state named S and a new final state named F. A B