1. (25) [Circular Interval scheduling] Textbook Exercise 17 in Chapter 4. Write (a) the pseudocode of an executable algorithm, (b) the analysis of the running time complexity, and (c) proof of the optimality of the algorithm. Your algorithm, CircIntvlSched, can call IntvlSched shown below if and as needed. Consider the implementation of IntvlSched that has the running time complexity O(n logn). The proof of optimality is trivial from the optimality of IntvlSched; consider the optimality of IntvlSched already proven. IntvlSched( {job 1, job 2, ..., job n} ): Sort the n jobs by finish time so that f(1) = f(2)