Consider the following modification of Definition 2.6. An nfa with multiple initial states is defined by the quintuple M = (Q, , , Q0, F), Where Q0 Q is a set of possible initial states. The language accepted by such an automation is defined as

L(M) = {w : *(q0,w) contains qf, for any q0 Q0, qf F}. Show that for every nfa with multiple initial states there exists an nfa with a single initial state that accepts the same language.