[25 points] Consider the DFA on the left. Let's get started converting it to a regular expression. The result of massaging it into a GNFA is shown in the middle (any transitions that are not present are implicitly labeled with the regex). Now, rip out the middle state. On the right is what the resulting GNFA should look like-you just need to provide the label on each of the six transitions. (You do not need to continue ripping out the rest of the states.)