Please neatly if written. Use example 2.13 given to answer question 2.3.7.

Question!!

Read 2.3.7. Prove the claim.

Example 2.13: Consider the NFA N of Fig. 2.15. L(N) is the set of all strings of O's and 1's such that the nth symbol from the end is 1. Intuitively, a DFA D that accepts this language must remember the last n symbols it has read. Since any of 2" subsets of the last n symbols could have been 1, if D has fewer Example 2.13: Consider the NFA N of Fig. 2.15. L(N) is the set of all strings of O's and 1's such that the nth symbol from the end is 1. Intuitively, a DFA D that accepts this language must remember the last n symbols it has read. Since any of 2" subsets of the last n symbols could have been 1, if D has fewer