Let I be a set of intervals on the real line. A subset C I is said to be cover of I if the intervals in C cover the intervals in I . For example, if I = {[2, 6), [3, 5), [5, 10), [7, 11), [9, 13), [5, 12)}, then C = {[2, 6), [5, 10), [7, 11), [9, 13)} is a cover of I. The size of a cover is just the number of intervals in it. Given a set of interval I of size n, design an efficient algorithm that finds a minimum size cover of I.