Question $3$:

Consider the following map. The task is to color the map using the four colors red, blue, yellow, and green, such that no two adjacent regions take the same color.

Give a suitable representation $($state representation, initial state, goal state, operators, and path cost$).$

Draw an abstract constraint graph with a node for each variable and an edge between two variables if there is a constraint between them

Color the map using Backtracking Search with MCV heuristic.