Run the AcyclicCG algorithm as described in the lecture slides for the problem defined in Exercise 1. More precisely, execute its 4 steps as follows: (a) Draw the constraint graph of y. Pick "f" as the root and draw1 the directed tree obtained by step 1 (Chapter 6 post- handout slides 35 onwards). 2 points (b) Give the resulting variable order obtained by step 2. If the ordering of variables is not unique, break ties by using the alphabetical order. 2 points. (c) List the calls to Revise(y, vparent(i), vi) in the order executed by step 3, and for each of them give the resulting domain of vparent(i). 2 points. (d) For each recursive call to Backtracking With Inference during step 4, give the domain D' vi of the selected variable vi after Forward Checking, and give the value d E D' vi assigned to vi. 2 points. Note: Step 4 runs BacktrackingWithInference with variable order v1, . . . , vn. This means that, at the ith recursion level, "select some variable v for which a is not defined" wil