i want a simple answer for each part please..

4. (30 points) CSP, n-Queen Puzzle Problem and Backtracking N-Queen puzzle problem is used to test AI algorithms. If solutions that differ only by the symmetry operations of rotation and reflection of the board are counted as one, the 8-queen puzzle has 12 solutions. These are called fundamental solutions; 3 of them are shown below. a b c d e f gh a a b d e f g h 8 8 8 8 8 8 b c d e f g h M ME MA 7 7 7 7 7 7 6 W 6 6 6 M 6 5 W 5 5 MA 5 5 M 5 4 4 4 M 4 4 4 W 3 3 3 3 3 W 3 2 M 2 2 w 2 w 2 2 1 M 1 W 1 1 1 1 a b de f g h a b d ef g h a b c d e fg h Solution 1 Solution 2 Solution 3 a) Formulize the 8-Queen problem using CSP. What are variables, domains, and constraints of the problem? b) What is the goal of the game? c) How many steps are required if you use brute force search in 4-queen and 8-queen problems? That is you generate and test all configurations for both cases. d) What is the backtracking search algorithm? How does it work in general? e) How does the backtracking algorithm work using the constraints you define in (a)? f) How can you include the forward checking heuristic to the backtracking algorithm