Mr. Bloop decides to take a break from his adventures, and invites his friends Atticus, Carol, and Diana to a restaurant. The guests are picking their entrees at a restaurant. The entrees are pizza, tacos, lasagne, and sushi. They have some strict dietary preferences: 1. Carol will not order sushi. 2. Atticus and Mr. Bloop want to try each other's food, which is pointless if they both order the same dish. So Atticus and Mr. Bloop will order different dishes. 3. Mr. Bloop likes Italian food, so he will only order pizza or lasagne. 4. Carol likes to be unique in her food orders and will not order the same dish as anybody else, with one exception: Atticus and Carol are actually clones, and always order the same dish as each other. 5. Diana really dislikes tacos and will not order them. (i) [3 pts] Draw the corresponding constraint graph for this CSP. (ii) [4 pts] We will run basic backtracking search to solve this CSP and make sure that every person (variable) is matched with their dream dish (value). We will select unassigned variables in alphabetical order, and we will also iterate over values in alphabetical order. What assignment will backtracking search return? (iii) [3 pts] Now we will run one iteration of forward checking. Assume that no values have been assigned to the variables. Write down the value(s) that will be eliminated if we assign "pizza" to Atticus. Write down "None" if no values will be eliminated. - Value(s) that will be eliminated for Mr. Bloop: - Value(s) that will be eliminated for Carol: - Value(s) that will be eliminated for Diana