Given input (a1, , b2), . . ,(an, bn) as above, where ai is the joining year and bi is the leaving year for the member i.: devise a better algorithm that should take n log n.

Which best compares appointments and events in outlook 2010appointments have a subject man, and events do notappointments have a specific date or range of dates, and events do notappointments have a start and end time of day, and events do notappointments have a location option, and events do not