find an equivalent NFA (without epsilon-moves) using the 3 step method explained below:

1. Repeat as many times as possible: for an epsilon-transition from a rejecting state to an accepting state, make the rejecting state accepting.

2. Repeat as many times as possible: for states q, r, and s with an epsilon-transition from q to r and an a-transition from r to s (a is an alphabet symbol) but no a-transition from q to s, add an a-transition from q to s.

3. Remove all epsilon-transitions.

If the resulting NFA has unreachable states, you can remove those, too.