8. Recall that NFA accepts a string as long as at least one of the states that the machine is an accepting state, after consuming the entire input. Here, we define strict-NFA that computes similarly as a normal NFA but this machine accepts input string w if all states that the machine is in are strictly from the set of accept states. Show that strict-NFA is equivalent to DFA