True or False For every regular language, there is a DFA that has exactly one accepting state (i.e. |F| = 1) that recognizes the language. Briefly justify your answer. (b) True or False For every regular language, there is an NFA that has exactly one accepting state (i.e. |F| = 1) that recognizes the language. Briefly justify your