(5 points) An all-NFA M is a 5-tuple (Q, ,, F) that accepts a string x E * if every possible state that M could be in after reading input a is a state from F. Note, in contrast, that an ordinary NFA accepts a string if some state among these possible states is an accept state. Given an all-NFA M = (Q, , ,go, F), show how to construct a DFA D such that that L(D) = L(M)