solve b-e

The problem is to color the sections such that no two sections sharing a border have the same color. You are allowed to use the colors (Red, Green. Blue). Part b: Assuming you are using Backtracking search to solve this problem and that you are using MRV with degree heuristic to select the variable, which variable will be selected at each level ofthe search tree [You do not need to draw the tree. Just let me know which variable will be selected and why (MRV and degree values)]. Note: Multiple possible correct answers. You only must give one. Part c: (10 points) Assume you assign the color Red to the first variable selected in part b. Show the steps involved in checking the remaining legal values for all other variables using Arc Consistency. Part d:(5 points) Can you use structure of the problem to make solving it more efficient? Part e: (Extra Credit 10 points) Give one valid solution to this problem. (You just must give the solution. No need to give all the steps).

V Ri Re C S Outline of a Map