Consider the constraint graph of Figure 4.17 with named binary constraints. r1 is a relation on A and B, which we write as r1(A, B), and similarly for the other relations. Consider solving this network using variable elimination.

(a) Suppose you were to eliminate variable A. Which constraints are removed?

A constraint is created on which variables? (You can call this r11.)

(b) Suppose you were to subsequently eliminate B (i.e., after eliminating A).

Which relations are removed? A constraint is created on which variables?