3. Consider the following CSP (constraint satisfaction problem) below:

You want to color the vertices with the colors red, blue and black in a way that adjacent vertices have different colors. a) Explain how to solve the problem using backtracking. b) Present the algorithm to solve the problem. c) Assume that the assignment of values was evaluated 1 = R, 4 = C, 5 = R, 8 = C, 6 = B. Explain how the forward checking operation operates in this example and how it is detected the need for backtracking