Conversion from DFA to Regular Expression

1. Considering the following DFA M given as its state diagram. Use the GNFA method discussed in the lecture to convert the given DFA M to a regular expression R. Please show the entire construction, step by step and remove states in the following order: q0 followed by q1 and then q2. Write incoming and outgoing states, as well as the respective regular expression for the remove state in each step

start 90