The alphabet is E = {a,b,c}. Consider the NFA a E F C b a b G Using the subset construction algorithm we convert the NFA to the following DFA where states, X, Y, Z, W, U are subsets of {E, F, G): a X Y ( a N b a a w U b, c b Write out explicitly the states of the DFA, that is write what are X=..., Y=..., Z=..., W=..., U=