Let KJB be the language over the alphabet {a,…, z} consisting of those words occurring in the King James Bible, so KJB = {in, the, beginning, god, created,…} Describe (informally) an NFA whose language is KJB. Describe, again informally, what happens when you apply the subset construction to this NFA to get a DFA, ignoring unreachable states. Roughly, how does the number of states in the DFA compare to the number in the NFA? How does each number compare to the number of distinct words in the King James Bible, which according to someone on the Internet is 14,564?