The questions is to build a transition diagram for nondeterministic finite automata that accepts the language of all strings that contain both 101 and 010 as substrings. This is what I came up with but I am not sure if it is right:
Secondly, what is the point of the epsilons. Why not replacing them with the symbol (0 or 1). I hope it is clear what I mean.