(3 points) Consider a problem with four variables, {A,B,C,D). Each variable has domain {1,2,3,4}. The constraints on the problem are that AB,BC, A=D.C#D. Suppose that we want to solve this problem with local search using Iterative Best Improvement. Assume we start with the following "random" assignment of values to variables shown in the first line. Use a two-stage choice algorithm to find a satisfying assignment of the variables. That is, first choose (one of the) variable(s) that participates in the most conflicts. Then choose a value of that variable that minimizes the number of conflicts for that variable. Then repeat so long as there are conflicts. To determine if there are conflicts, fill out the "evaluation" column with the number of constraints that are not satisfied with the given assignment. Keep going until you have no conflicts. (You may not need all the lines.) A B D Evaluation Conflicts participated in B C D II TI 1 4 1 2 3