DFA that is equivalent to a regular expression

GNFA equivalent to M:

1)

Choose a state q Q. List all preservation paths for q in N0.

(q_i,q_j) = R_i, where q_i Q, q_i q_j, and R_i RE

2) Modify N0 to construct an equivalent GNFA called N1 that contains all states in N0 except for the state you chose.

I don't understand preservation paths and I think I understand 2 but I just need some help to make sure I'm on the right path. Any help is amazing thank you!

M NO