Q1 CSPs: Ghost House 7 Points The four Pacman ghosts are named Blinky (B), Pinky (P), Inky (I), and Clyde (C). When a game of Pacman starts, the four ghosts need to choose their starting spots in the ghost house. We'll label the four starting spots 1,2,3,4. However, the ghosts have some preferences, so they introduce some constraints: - Each starting spot fits exactly one ghost. - B>P (Blinky would like a higher starting spot number than Pinky.) - BI=1 (Inky and Blinky would like to be next to each other.) - P=1 (Pinky doesn't want to be at the first spot.) We can formulate this problem as a CSP, where the ghosts (B,P,I,C) are variables, and the starting spots (1,2,3,4) are the values. Q1.6 1 Point After running forward checking, is the CSP arc-consistent? Yes No Q1.7 1 Point Pacman notices that Clyde doesn't have any preferences, and suggests splitting this CSP into two independent subproblems: one with Blinky/Pinky/Inky, and one with Clyde. Then, we can solve each subproblem separately and combine the resulting assignments at the end. Will Pacman's suggestion always produce a valid solution to the overall CSP? Yes No Briefly justify your answer. (1-2 sentences is enough.) Enter your answer here