5. (20 Points) State True or False for each of the following questions. If your answer is False, provide a brief justification. (a) In a DFA every state has exactly one exiting* transition for each symbol in the alphabet. * Note: We are also considering transitions from a state to itself as exiting transitions. (b) In a DFA there may be a state that has an arrow labeled with the empty string e. (c) An NFA may have a state with no exiting arrows for an alphabet symbol. (d) An NFA may recognize a language which is not recognized by any DFA. (e) The language of base-16 representations of the natural numbers is regular. 6. (10 Points) Show that the following language is not a regular language using the pumping lemma. A= {0"1" 2" |n>0}