Problem 2: all-NFAS An all-NFA is defined in Sipser, problem 1.43 as a 5-tuple (Q,,8,90, F') that accepts re* if every possible state that M could reach after reading input r 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. Problem 2: all-NFAS An all-NFA is defined in Sipser, problem 1.43 as a 5-tuple (Q,,8,90, F') that accepts re* if every possible state that M could reach after reading input r 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