Given (w V xv y vz) ∧ (WV)∧ (XVý)^(y vz) ∧ (W vz). Use backtracking (where each stage of the state space tree represents an assignment of a truth value to a boolean variable. Assign the values to variables in order w, x, y, z. As you assign values, new subproblems will be formed since some clauses will become true and thus can be safely ignored or it may be clear that a clause will be forced to be false in which case there is no need to explore any further down that subtree since you know the entire expression will be false for that subtree. Required:
Draw a complete picture of your search tree obtained using backtracking and the variable ordering given above.