Problem 2: all-NFAs An all-NFA is dened in Sipser, problem 1.43 as 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). If any brach in an all-NFA computation reaches an implicit or explicit sink state, the input is not accepted. Show how an all-NFA can be converted to an equivalent DFA. Hint: Adjust the conversion from NFA to DFA shown in the lectures