coloring Consider coloring the six$-$region map with three colors: R$,$ G$,$ B so that no two adjacent

regions that share a border have the same color. Regions that only meet at a corner are not

considered adjacent $($e$.$g$.,5$ and$).$

a$.$Formulate this problem as a CSP$.$ Clearly state the variables, domains, and constraints.

b$.$ Draw an abstract constraint graph with a node for each variable and an edge between two

variables if there is a constraint between them.

c$.$ Color the map using Backtracking Search with MCV heuristic. Note: Variables and values are

ordered as follows:

$*$Variables: $1,2,3...6($ascending order$).$

$-$Values: Red, Blue, and Green.