An everything-NFA is a 5-tuple (Q, , , q0, F) that accepts x if every possible state that M could reach after reading input x is in F (as opposed to at least one). Should a brach in an all-NFA computation reach an explicit or implicit sink state, the input is not accepted. Show how an all-NFA can be converted to an equivalent DFA.