COMPUTATION THEORY

For this question. E= {0.1.2.3.4,5,6,7,8,9). A fancy new suitcase has a lock that is opened only if a special number is entered. A special number is any string of digits of length at least three where the last three digits of the string are not 000. (So, for example, 123456 is a special number and 4680 is also a special number but 98765000 is not a special number and 65 is not a special number.) Exhibit an NFA that will determine whether or not an input string is a special number so that the NFA would accept that input value and the suitcase would unlock or the NFA would reject and the lock would not open. (Draw the NFA on one of the pieces of paper in front of you (that has your name written at the top). Write - Part 3' on the paper and nothing else. In the Answer Space below, only write the number of states in your NFA and the number of transitions, not including the in-arrow to the Start state.)