Please don't copy
Extracted text: For the following Constraint Satisfaction Problem: Variables: {A, B, C, D} Domains: A = {1, 2, 3}, B = {1, 2, 3, 4}, C = { 1, 2, 3} , D = {1,2} %3D Constraints: (А, B) — (1,1), (2,2), (3,3)} (А,D) 3 {(1,2), (2,1), (3,1)} (В,C) %3 (1,3), (2,1), (4,1), (4,2)} (D,C) = {(1,1), (1,3), (2,2)} a) determine the size of the search space b) Illustrate how to solve the problem using backtracking, forward checking, and arc consistency with forward checking SHOW ALL WORK.