Given a set of n intervals I , each interval Ii = [xi1, xi2], where xi1 and xi2 are the endpoints of I. Two intervals, Ii = [xi1, xi2] and Ij = [xj1, xj2], are said to overlap each other if xi1<= xj2 and xj1<= xi2. A subset of intervals S ? I is said to be independent if each pair of intervals in S do not overlap each other. Design an efficient algorithm for computing an independent subset of intervals S ? I, and the cardinality of S is maximized. For example, in Figure 1, {I3, I5} is an independent set, but it is not a maximum independent set. Actually, {I1, I2, I5} is a maximum independent set.