Constraint Satisfaction Problems (20 points) Recall the map coloring problem we discussed in class. Your objective is to assign one of the three colors Red (R), Green (G), and Blue (B) to each region such that no two adjacent regions have the same color. Use the backtracking algorithm to solve this problem for the figure shown below. Solve the problem using each of the following strategies we discussed in class (For more details, refer to the slides which are available on the course website): (i) Minimum Remaining Values heuristic (ii) Degree heuristic (iii) Least Constraining Value (iv) Forward Checking Clearly show the steps. Also, clearly state your assumptions (wherever applicable)