Question$3.$ Consider coloring the map of the

southwestern part of the United States, shown at right,

with three colors $($R$,$ G$,$ B$)$ so that no two neighboring

regions that share a border have the same color. We

can represent this as a six$-$variable CSP graph. The

states are CA $($California$),$ OR $($Oregon$),$ NV $($Nevada$),$

AZ $($Arizona$),$ ID $($Idaho$),$ and UT $($Utah$),$ and their

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

$($a$)[5]$ Draw the condition graph.

$($b$)$ Apply the $[25]$ tree$-$structured CSP algorithm on the

graph and determine the values that the nodes can take

from the domain.