Hi i Need help with this problem related to Compilers. Thank You.

Problem 2: Graph Coloring (40/100) Consider the following interference graph: Assume that the target machine has just three registers. a Apply Chaitin's graph coloring algorithm (described in Lecture D) to the graph. Which virtual registers are spilled? Which are colored? Assume you can feasible registers for spilling purpose. b Apply Chaitin-Brigg's method (described in Lecture D) to the graph. Which virtual registers are spilled and which are colored? In general, does the choice of spill node make a difference