Homework 6: Constraint Satisfaction Search Consider the following graph coloring instance with the colors R, G, B. Two nodes have been colored already. Answer the questions that follow. c. d. For each node, ndicate the initial availability lists if we were to do one pass of forward checking (only) off of the two pre-colored nodes. I. b. d. e. g- For each node, indicate the availability lists after running complete constraint propagation, but without any search. 2. b. e. g