Given n open intervals $($a$1,$ b$1),($a$2,$ b$2),...($an$,$ bn$)$ on the real line, each representing 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. Show that a greedy algorithm

based on earliest finish time first yields an optimal solution.

$1$