Explain your answer.

You decide to try a new approach to using are consistency in which you initially enforce arc consistency, and then enforce arc consistency every time you have assigned an even number of variables. You have to backtrack if, after a value has been assigned to a variable, X, the recursion returns at X without a solution. Concretely, this means that for a single variable with d values remaining, it is possible to backtrack up to d times. For each of the following constraint graphs, if each variable has a domain of size d, how many times would you have to backtrack in the worst case for each of the specified orderings? (i) [6 pts] A-B-C-D-E: A-E-B-D-C: C-B-D-E-A: (ii) 6 pts A-B-C-D-E-F-G: F-D-B-A-C-G-E: C-A-F-E-B-G-D