Starting from the DFA shown below, use the construction DFA to Regular Expression to find a regular expression that describes the same language as is recognized by the DFA.

a) Draw the initial GNFA (with new start and accept states etc) then the GNFA obtained after ripping each state until just q_start and q_accept are left. If you did everything correctly, your label for the last remaining arrow should be the answer.

b) Give a simple English description of the language for the DFA in Part a. That means a sentence in the style of "All strings that have at least two 1's and end with a 10"