Please fast to this AI problem. Thanks.

We are now coloring a map of the six U$.$S$.$ states: California, Oregan, Nevada, Arizona, Idaho, and Utah, with the three colors $(r,g,b\}.$ The map shown in the following is thus represented as a CSP graph with six variables, three values, and constrained by no adjacent regions having the same color. Note that the alphabetic order is in place when several variables tie. The variable set is defined as $V=\{AZ,CA,ID,NV,OR,UT\}$ in alphabetic order.

Draw the constraint graph for the map colouring problem.

NV has been assigned to value g$.$ Now you can apply forward checking to cross out values for the other variables on the following table.

$\backslash$table$[[CA,$OR$,$NV$,AZ=,ID,$UT$],[rgb,rgb,g,rgb,rgb,rgb$