12. Consider the constraint graph of Figure 4.16 with named binary constraints. Ti is a relation on A and B, which we can write as r (A,B), and similarly for the other relations. Consider solving this network using VE. 11 13 2 15 16 17 18 19 10 Figure 4.16: Abstract constraint network (a) Suppose you were to eliminate variable A. Which constraints are removed? A constraint is created on which variables? (You can call this 111). (b) Suppose you were to subsequently eliminate B (i.e., after eliminating A). Which relations are removed? A constraint is created on which variables