Q3. Map Coloring Please refer to supplied code with this homework. It creates a simple class data structure to represent a graph. You can add/delete edges in the graph, and can assign a particular value (Red, Green, Blue) to a node in graph. We studied famous map coloring problem in the class, in which you have to color each node such that no two adjacent nodes are assigned same map color. We can solve this problem with a backtracking algorithm, and it can be further improved with arc-consistency applied. In the provided code, the function makeArcConsistent is to be developed so that it shrinks the domain values of nodes, as some of the variables have been assigned the values. Q3. Map Coloring Please refer to supplied code with this homework. It creates a simple class data structure to represent a graph. You can add/delete edges in the graph, and can assign a particular value (Red, Green, Blue) to a node in graph. We studied famous map coloring problem in the class, in which you have to color each node such that no two adjacent nodes are assigned same map color. We can solve this problem with a backtracking algorithm, and it can be further improved with arc-consistency applied. In the provided code, the function makeArcConsistent is to be developed so that it shrinks the domain values of nodes, as some of the variables have been assigned the values