Constraint Solving Question 12 (3 Points). Consider the following constraint system. The variables are X = {x1,x2} with domains x1 D = [0,1] and x2 D = [0,1]. The constraints are C x1 x2 +0.2 C2 x1 = x Perform propagation on the domain D = DxD2 using the constraints {C1, C2} by enforcing arc-consistency. Show how the domains on each variable will be updated in the first several propagation steps, and what are the end results that you will obtain by iterating such propagation.