Convert the DFA (over Sigma = {a, b} presented on the figure below to a corresponding regular expression. Show the process of converting the DFA to a two-state GNFA step-by-step (i.e., show the initial GNFA with 5 states, then an equivalent GNFA with 4 states, and so on up to 2 states). Note that the resulting regular expression might be quite long