CSP techniques are useful in solving complex configuration and allocation problems. You are given the task of allocating four developments in a new site in Whistler. You have to place a housing complex, a big hotel, a recreational area and a garbage dump. The area for development can be represented as 3 times 3 grid (three rows 0, 1, 2 and three columns 0, 1, 2) and you need to place each development in one cell of the grid. Unfortunately there are some practical constraints on the problem that you need to take into account. In the following, A is close to B if A is in a cell that shares an edge with B (sharing a corner does not make two objects close). There is a cemetery in cell 0, 0. There is a lake in cell 1, 2. The housing complex and the big hotel should not be close to the cemetery. The recreational area should be close to the lake. The housing complex and the big hotel should be close to the recreational area. The housing complex and the big hotel should not be close to the garbage dump. a) Represent this problem as a CSP (i.e. you should end up with a list of variables and a list of constraints). You may assign labels to the objects. Indicate the initial domains of the variables, and specify the constraints using mathematical or logical operators where possible. Do not forget some basic constraints that are inherent in allocating objects in space but are not listed above. We want your answers to be: correct precise and readable enough that someone could implement them without asking you for clarification reasonably formatted b) Draw a constraint graph for this problem (screenshots are fine). 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