Problem 5: CSP (15 points) Consider the following constraint graph for a graph coloring problem (the constraints indicate that connected nodes cannot have the same color). The domains are shown in the boxes next to each variable node. R 2 2 R.G.B R,G,B 5 R,B R.G.B A. What are the variable domains after a full constraint propagation