Could you help me answer P14.6.4 please?

whose k+ 1'st to last letter with k 2 P14.6.4 In Problem 14.3.4 we defined the language S ?'2k of strings exists and is a. (Here k is an arbitrary natural.) Design an NFA for this language w states and apply the Subset Construction to it. Minimize your DFA if necessary. You now have an example that will prove a theorem of the following form: For every n with n 2 no, there exists a language that has an n-state ordinary NFA and whose minimal DFA has f(n) states. You get to pick no, and the function f(n) should be as large as you can make it. whose k+ 1'st to last letter with k 2 P14.6.4 In Problem 14.3.4 we defined the language S ?'2k of strings exists and is a. (Here k is an arbitrary natural.) Design an NFA for this language w states and apply the Subset Construction to it. Minimize your DFA if necessary. You now have an example that will prove a theorem of the following form: For every n with n 2 no, there exists a language that has an n-state ordinary NFA and whose minimal DFA has f(n) states. You get to pick no, and the function f(n) should be as large as you can make it