Answer Happy

4. For this question, consider a different generic CSP that we are running the arc consistency algorithm on. In particular, you find that the variable X, is involved in constraints with 10 other variables and that the variable X2 is involved in constraints with 12 other variables. While running the arc consistency algorithm we reach a point when all variables have 4 values left in their domains, and we have one last are in the queue: X1 X2 (a) Now we are processing the arc X1 X2. We are able to remove a value from the domain of a variable, and add the necessary arcs into the queue. How many arcs are in the queue now? (A) 3 O (B) 4 O (C) 5 O (D) 10 O (E) 12 (F) 18 (G) None of these O (H) We cannot determine the exact number of arcs No more 1 (b) Following the previous part, we processed any arcs that may have been added to the queue. values were removed from any variable. As a result, we plan to assign a value to one of the variables to continue with backtracking search. Pick the statement below that is most valid. (A) We should assign a value to X, because it has the Least Constraining Value (B) We should assign a value to X, because it has the Minimum Remaining Values (C) We should assign a value to X2 because it has the Least Constraining Value (D) We should assign a value to X2 because it has the Minimum Remaining Values (E) We should assign a value to some X; (i > 3) that has the Least Constraining Value (F) We should assign a value to some X; (i > 3) that has the Minimum Remaining Values