i$)$ What is Non$-$Deterministic Finite Automata?

ii$)$ Convert the following $-$NFA to DFA using the subset construction method. Provide a transition diagram for the converted DFA.

iii$)$ Write the $-$closure of all the states.

b