Recall that in the Activity Selection problem, we are given n intervals {[s1,f1),...,[sn,fn)}. The interval coloring problem is to find a minimum set C of colors such that each of the n intervals is assigned a color in C and any pair of overlapping intervals are assigned two different colors. Design an efficient algorithm for the interval coloring problem.