1. 5pt] An everything NFA N is defined to be a 5-tuple (Q, 2, ,90, F) that accepts w ES* provided that every possible state that N could be in after reading w is a state in F. (By contrast, recall that the ordinary NFAs we've seen in lecture accept their input if there exists at least one accepting state among these aforementioned possible states.) Show that everything-NFAs, like ordinary NFAs, recognize the class of regular languages