Assume the alphabet $=\{0,1\}.$ Consider the Nondeterministic Finite Automaton $($NFA$)N$ depicted in Fig. B and answer the following questions.

Given a string $w=00,$ will NFA $N$ accept $w?$

Given a string $w=101,$ will NFA $N$ accept $w?$

Given a string $w=111,$ will NFA $N$ accept $w?$

Does there exist a computation path such that the NFA $N$ will "hang" after running on string $w=000?$

Please use accurate natural language to describe the language $L(N)$ of NFA $N,$ i$.$e$.,$ which binary strings in ${}^{**}$ can be accepted by $N.$ You can also describe $L(N)$ using math or computer science style notation.

Figure $2$: The NFA $N$ in Question $2.$