Consider the following Non$-$deterministic Finite Automaton $($NFA$)$ with the $5-$tuple of $(Q,,q_0,F,)$ :

Which statement$($s$)$ are true for this NFA? Select all that applies.

Note: $a^n$ means concatenating a with itself $n$ times.

All accepted strings must have $0101$ in their sequence.

All accepted strings must have the length of more than $4.$

$01xxxxxxx1$ is an accepted string where $x$ can be any member of input alphabet

${010}^{n}1$ is an accepted string where $n>8$

The equivalent DFA of this NFA will have one state more than this NFA.