6. The notion of acceptance for the model of nondeterministic finite automata (NFAs) is based on the existence of a computation (an execution) of the machine on the input that leads to an accepting state upon the completion of processing the input. We now define a new class of NFAs, called V-NFAs, in which an input string is accepted if all possible computations (executions) lead to an accepting state upon the completion of processing the input. (a) Show that every regular language is accepted by an Y-NFA. (b) Show that the language accepted by an V-NFA is regular