1. True or False. [5 points each (a)The language of all binary numerals for prime numbers is regular (b) ....-The language of all binary numerals for powers of 2 is regular. (c)Every subset of a regular language is regular. (d)A language L is regular if and only if there is some NFA M which accepts L 2. Fill in each blank with one word. [5 points each blank (a) Every NFA with n states is equivalent to a uniqueDFA, which has at most states. (I want the formula.) (b) If M is a machine, then, given any configuration z of M, there is at most one configuration y of M such that M can change from r to y in one step