Given n open intervals (a0,b0),(a1,b1),,(an1,bn1) on the real line (that is, each ai and bi is a real number), each representing the start and end times of some activity requiring the same resource, the task is to find the largest number of these intervals so that no two of them overlap. Prove that the earliest finish first algorithm always yields an optimal solution.