What happens if we do not sort optimal greedy algorithm for Interval Partitioning first then sorts the intervals by their starting times.

(a) Give an example where the algorithm would return a non-optimal schedule if it did not sort the intervals.

(b) Explain where the proof of correctness of the algorithm breaks down if the algorithm does not sort the intervals.