Please show clear steps and explanation when solving this NFA problem, thank you!

Given is an NFA below. In the context of converting this NFA to a regular expression, follow the following steps - Step 1. insert a new start state S and add an edge (S,1) labeled - Step 2. insert a new final state f and add two edges (2,f) and (4,f) both labeled - Step 3: Remove state 3 - Step 4: Remove state 6 - Step 5: Remove state 2 - Step 6: Remove state 5 - Step 7: Remove state 4 - Step 8: Remove State 1 What is the edge from 4 to 4 right after Step 6 ? (ab) a (ba) aba