a$)(6$ pts$)$ Apply arc$-$consistency $($constraint propagation$)$ alone. Provide the resulting

values assigned to each node.

b$)(12$ pts$)$ Apply backtracking with forward checking using lexical ordering. Show the

tree, backed$-$up nodes, and value pruning clearly.

c$)(6$ pts$)$ Now, apply pure backtracking using the following variable ordering:

$($D$-$B$-$G$-$F$-$A$-$E$-$C$\}.$