Solve the following map coloring problem as a constraint satisfaction problem. a. Using the minimum-conflicts heuristic, show the random start, hill-climbing search tree, when the random start initial state is (Cl=red, C2=blue, C3=green, C4=red, C5=blue, C6=green, C7 = blue). b. Show the search tree and solution when using backtracking, with MRV heuristic, most- constrained variable heuristic, the least constrained value, and forward checking with arc consistency. c. For this example, which approach (a or b) is more efficient? d. For most CSP problems, which approach is more efficient? Why? C3 C2 ci C7 C4 C6 C5 Solve the following map coloring problem as a constraint satisfaction problem. a. Using the minimum-conflicts heuristic, show the random start, hill-climbing search tree, when the random start initial state is (Cl=red, C2=blue, C3=green, C4=red, C5=blue, C6=green, C7 = blue). b. Show the search tree and solution when using backtracking, with MRV heuristic, most- constrained variable heuristic, the least constrained value, and forward checking with arc consistency. c. For this example, which approach (a or b) is more efficient? d. For most CSP problems, which approach is more efficient? Why? C3 C2 ci C7 C4 C6 C5