Convert DFA into a GNFA Please I need a help to convert the deterministic finite automata in the example bellow into generalized non-deterministic finite automaton, please.

The GNFA has:

*

*The arrows connecting two states are labeled with regular expressions.

*There is a unique final state that cannot be the same as the initial state.

*Each state (except for the final state, from which no arrow emerges) has an arrow pointing to all other states.

*Each state (except for the initial state, which does not receive arrows from any other state) receives an arrow from all other states.

*Each state (except for the initial and final states) has an arrow pointing to itself.


Hint. Let $E$ be a regular expression representing your language. Then
$$
q_0 \xrightarrow{E} q_1 
$$
is an automaton satisfying all your requirements.
