) Consider n tasks, each with starting and finishing times (real numbers). Wed like to check that each task is running properly. At a timepoint t we can simultaneously check all tasks that are running at that time (for which t is strictly between task start and finishing time). Give an algorithm that finds the smallest set of timepoints so that each task is checked at least once.