Please solve it step by step and cleary. Thank you.

(20 points) Suppose you have n classes that you want to schedule in rooms. Each class has a fixed time interval at which it is offered, and classes whose times overlap cannot be scheduled in the same room. There are enough rooms to schedule all the classes. Design a greedy O(n log n) time algorithm to find an assignment of classes to rooms that minimizes the total number of rooms used