A constraint graph for a map coloring problem is given below. Each node corresponds to a region and arcs between the nodes indicate adjacency between the regions. Adjacent regions must be colored a different color (R=Red, G=Green, B=Blue). Consider the assignment given in the table. B has been assigned B and constraint propagation has been done, as shown in the table. Which of the following statements is FALSE?

E A B D G H H A B C RG B RG DE RGB RGB F G H RGB RG RGB If Dis assigned some value, only H will be affected. If minimum remaining value (MRV) heuristic is used to select next variable: A, C, or G will be selected as the next variable. If D = R assignment is done at this point, minimum remaining value (MRV) heuristic will choose C for the next assignment Assume that has been chosen as the next variable to explore at this point, least-constraining value heuristic (LCV) will try blue (B) first. If most constraining variable (degree) heuristic is used, G will be selected for the next assignment