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.1 1 Point If we enforce unary constraints and then use the Minimum Remaining Values (MRV) method to order the variable assignment, which variable will be assigned first? B P I C