Question 2 [35 points] CSP- Search Consider a CSP, where there are eight variables A, B, C, D, E, F, G, H, each with domain {1, 2, 3, 4). Suppose the constraints are: A>G |G-C| = 1 D != C G != F |E-FI is odd X=t Y=t failure Y=f Z-t solution Z-f failure X=f Y=t Z-t failure Z-f solution. . Y=f failure ASH |H-CI is even E != C H!= F a) [25 points] Use DFS with pruning to solve this problem, using the variable ordering A, B, C, D, E, F, G, H. To do this you will write (and then run) a program that generates the search tree (see below) reports all solutions (models) found, if any reports the number of failing consistency checks (i.e. failing branches) in the tree |F-B|=1 H = D E