Since its asked ib NFA, remember NFA accepts only set of valid strings. For the given language, the maximum length of sub-string will be the trivial one i.e. the string itself of length N. So to get the trivial string accepted “n+1” states are required and for the rest of strings we can make multiple transitions in single states. Hence option C is correct