CSCI 431 (Fall 18): Robotics Homework 3: Constraint Satisfaction Problem and Game Search Due: Nov. 5th Problem 1: Assume we have four variables (A,B.C.D) and two values (1,2). We write variable/value assignments as A1, B2, etc. Assume the only legal values are listed below: .A-B: A1-B1, A2-B1, A2-B2 . A-C: A1-C2, A2-CI B-C: B1-C2, B2-Ci .B-D: B2-D2 C-D: C1-DI, C1-D2 1. Assume you do full constraint progagation in this problem. Show the legal values for each variable after propagation. 2. Consider the following search tree. Assume that you do bucktracking with forward cheeking. Show the assignments in order as they are generated during the search. What is the first solution found in the search? A1 A2 B1 B2 81 82 C1) (2) (c) (c) (c) (c2) (c) (c2