Consider the following Non-deterministic Finite Automaton (NFA) with the 5-tuple of (0,8,90,5,6): 10,1 qo) q1 q2 q3 94 Which statement(s) are true for this NFA? Select all that applies. Note: an means concatenating a with itself n times. All accepted strings must have the length of more than 4. All accepted strings must have 0101 in their sequence. The equivalent DFA of this NFA will have one state more than this NFA. 010n1 is an accepted string where n>8 01xxxxxxx1 is an accepted string where x can be any member of input alphabet