We are given n intervals [l1,r1],[l2,r2],[l3,r3],…,[ln,rn] in the number line. We can divide the intervals into two sets such that no two intervals in the same set have overlaps. Prove that there are at most n−1 pairs of overlapping intervals. combinatoricsgraph theoryinduction