a Consider the iterative best improvement (IBI) local search algorithm ona constraint satisfaction problem (CSP) with 5 variables. The domain of the variables, and problem constraint are shown in Figure3. Show all the possible values of the variables that can cause the following evaluations on the constraint: (a).Evaluation = 0. (b). Evaluation = 1. (c). Evaluation = 2.

= = The CSP has 5 variables and their domain values are: dom(A) = dom(B) = dom(C) = dom(D) = dom(E) = {1, 2, 3, 4]. The constraint: {( B # 2) ^ (C 3) 1(C