1.

(a) Show that we can solve the telescope scheduling problem in O(n) time even if the list of n observation requests is not given to

us in sorted order, provided that start and finish times are given as integer indices in the range from 1 to n².