CSP techniques are useful for solving complex configuration and allocation problems. You are an architect who needs to decide how to position four new shops in a mall: a Japanese restaurant, a hairstylist, a clothing store, and a toy store. The floor plan can be represented as 3x3 grid (three rows 0,1,2 and three columns 0,1,2) and you need to place each shop in one cell of the grid. Marketing research has generated the following constraints on how to position the shops. Note that establishments are considered close to each other if they share an edge on the grid.

1) There is a fish and chips stand in cell (2,2).

2) There is a pharmacy in cell (0,0).

3) The hairstylist and the clothing store should not be close to the fish and chips stand

4) The Japanese restaurant should be close to the pharmacy.

5) The hairstylist and the clothing store should be close to the Japanese restaurant

6) The hairstylist and the clothing store should not be close to the toy store

1. a) [15 points] Represent this problem as a CSP (remember that this requires specifying variables, domains, and constraints)Be as precise as you can in specifying the constraints. Also do not forget some basic constraints that are inherent in allocating objects in space but are not listed above.

1. b) [5 points] Draw a constraint graph for this problem. If a constraint/domain is too long to fit easily in the graph, use a label in the graph instead, and indicate which constraint/domain the label refers to.