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 sub

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<a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/compilers-questions-answers-minimization-dfa-1-q6.png"><img alt="Find the string of length n from the given diagram" class="alignnone size-full wp-image-159837" height="86" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/compilers-questions-answers-minimization-dfa-1-q6.png" width="280"/></a>
B.	n 1
C.	n
D.	n + 1
E.	2n 1
Answer» D. n + 1