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.

Write a function balancechemical to balance chemical reactions by solving a linear set of equations. the inputs arguments are: reagents: symbols of reagents in string row array products: symbols of products in string row array elements: elements in the reaction in string row array elcmpreag: elemental composition of reactants in two dimensional numeric array elcmpprdcts: elemental composition of prducts in two dimensional numeric array hint: the first part of the problem is setting up the set of linear equations that should be solve. the second part of the problem is to find the integers from the solution. one way to do this is to mulitiply the rational basis for the nullspace by increasing larger integers until both the left-and right-side integers exist. for example, for the reaction that involves reacting with to produce and : reagents=["ch4", "o2"]; products =["co2", "h2o"]; elements =["c","h", "o"] elcmpreag=[1,4,0;