E A B D F G H RG B B RG D RGB E RGB F RGB G RG H RGB If most constraining variable (degree) heuristic is used, G will be selected for the next assignment. If D = R assignment is done at this point, minimum remaining value (MRV) heuristic will choose C for the next assignment If Dis assigned some value, only H will be affected. 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 minimum remaining value (MRV) heuristic is used to select next variable: A, C, or G will be selected as the next variable. (LO5) Consider the game tree below. The leaf utilities are written as pairs (UA,UB), with the first and second component indicating the utility of that leaf to A and B, respectively. Assume that each player maximizes their own utility. In this game tree, UA(s)+UB(s)[