Let w be any string of length n is {0,1}*. Let L be the set of all substring of w. State the minimum number of states in a NDFA that accepts L?

Let w be any string of length n is {0,1}*. Let L be the set of all su

1.	Let w be any string of length n is {0,1}*. Let L be the set of all substring of w. State the minimum number of states in a NDFA that accepts L?
A.	n – 1
B.	n
C.	n + 1
D.	2n – 1
Answer» D. 2n – 1