Problem 4 (20 marks) For an NFA A = (Q, 2,90,8,F), define L (A) to be the set of words w * such that for all runs 90, ...,9 of A on w, the last state q is in F. (Compare with the definition of L(A), which is the same, except that it uses "for some" in place of for all".) Intuitively, this definition amounts to a change of the acceptance 1 condition for NFA's. Show that it does not actually make a difference to the set of languages that can be accepted. That is, show that for all languages L, there exists an NFA A such that L = L(A), if and only if there exists an NFA B such that L=L(B). Problem 4 (20 marks) For an NFA A = (Q, 2,90,8,F), define L (A) to be the set of words w * such that for all runs 90, ...,9 of A on w, the last state q is in F. (Compare with the definition of L(A), which is the same, except that it uses "for some" in place of for all".) Intuitively, this definition amounts to a change of the acceptance 1 condition for NFA's. Show that it does not actually make a difference to the set of languages that can be accepted. That is, show that for all languages L, there exists an NFA A such that L = L(A), if and only if there exists an NFA B such that L=L(B)