Problem $6.$ Printing Press Scheduling

Consider a scheduling problem for a single printing press. We are given a set T of printing jobs specified by their start and finish times, and we have only one printing press, and we wish to maximize the number of jobs that this single press prints.

a$)$ Design a greedy algorithm for this problem.

b$)$ Prove that this algorithm is correct.

c$)$ What is the running time of this algorithm? Explain your answer