Q$3.$ Consider coloring the six$-$county map shown at

right with three colors so that no two neighboring

counties that share a border have the same color.

We can represent this as a six$-$variable CSP chart.

domain values are determined as $\{R,G,B\}.$

$($a$)$ Draw the condition graph.

$($b$)$ Apply the tree$-$structured CSP algorithm on the graph and determine the values that the

nodes can take from the domain.$|$