It is not clear to me what is being asked here.
Compute the set of states from which the states satisfy !(a&b) can be reached symbolically, and submit the solution in disjunctive normal form.
My interpretation: We need to find a set of states that satisfy !(a&b) and are reachable... Which refers to the universal predecessors of !(a&b)?
