Non deterministic finite automata

 which is True /false plz Explan ??? 
A) if M is an nfa with single final state accepting language L,then a machine M,obtained by reversing all arrows and making final state to initial state and initial state to final state,will accept the language L^R.
B) A regular grammer is one which is either right linear or left linear or neither
C)if an nfa accepts a string of length at least equal to its number of states ,then its language is infinite.
D) The set L is subset of universal language is accepted by some FA if L is the union of some of the equivalence classes of a right invariant equivalence relation of finte index.