Decide whether each statement is true of a DFA or an NFA or whether the statement is true or false:

Every state has exactly one exiting transition arrow for each symbol in the alphabet. Blank $1$

States can have more than one exiting transition arrow for a symbol in the alphabet. Blank $2$

States can have no exiting transition arrows for a symbol in the alphabet. Blank $3$

The labels on the transition arrows are symbols from the alphabet. Blank $4$

One of the transition arrows has the label $\backslash$epsi

$.$ Blank $5$

The machine splits into multiple copies of itself and follows all of the possibilities. Blank $6$

If any one of the copies of the machines is in an accept state, the machine accepts the input string. Blank $7$

If there are multiple copies of the machines, the machine accepts only the longest one. Blank $8$

The $\backslash$epsi

symbol acts as a free move. Blank $9$

Not every NFA can be converted into an equivalent DFA. Blank $10$

The transition function is $\backslash$delta :Q$\backslash$times $\backslash$Sigma $\backslash$epsi $$P$($Q$)$

$.$ Blank $11$

The transition function is $\backslash$delta :Q$\backslash$times $\backslash$Sigma $$Q

$.$ Blank $12$

P$($Q$)$

is the set of all states. Blank $13$

P$($Q$)$

is the power set of all states. Blank $14$