Exercise 4.11 Consider the constraint graph of Figure 4.15 with named binary constraints [e.g., r1 is a relation on A and B, which we can write as r1(A, B)].

Consider solving this network using VE.

(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?