Construct an NFA that does not use -transitions that recognizes the same language. Feel free to use a diagram for your answer. As always, when following a particular construction, follow the procedure as closely as possible, without making any extra simplifications. Please give clear steps with explanation and diagrams.

1. Consider the NFA (with transitions) defined by the following diagram (over the alphabet {0,1,2})