4. (7 points) Let M = (?, ?, ?, 90, F) be a deterministic finite automaton with K = {90, 91, 92, 93, 94, 95}, ? = {a,b}, and F = {95}. Suppose M recognizes the language (a U b)*abaab. Suppose ?(9?, ?) = 91, ?(91, 6) = 92, ?(92, ?) = 93, ?(93, 4) = 94 and ?(94,b) = 95. Thus in state qo, reading an a, the automaton goes to state q1, et cetera. Then which of the states {90, 91, 92, 93, 94, 95) are the following?
a) ?(go, b)
b) ?(q1, a)
c) ?(92, b)
d) ?(93, b)
e) ?(94, ?)
f) ?(95, ?)
g) ?(95, b)