Given Language:Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}How many state are required to execute L3 using NFA?

Given Language:Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right

1.	Given Language:Ln= {xϵ {0,1} * \| \|x\|≥n, nth symbol from the right in x is 1}How many state are required to execute L3 using NFA?
A.	16
B.	15
C.	8
D.	7
Answer» C. 8