Consider the NFA given by the following state diagram:

Simulate this NFA to show whether or not it accepts the string $0101.($For example, you can draw the tree with the nondeterministic computations.$)$ Consider strings with the aplhabet sigma$=\{0,1\}$