Consider the earliest-finish-time-first greedy strategy for the interval partitioning algorithm shown below, and prove or disprove if this strategy is optimal. Hint: remember we used a structural bound called depth, which denotes the largest number of intervals overlapping at any time.

IntvlPart(intervals): Sort intervals by finish time so f (1) S f (2) s S f (n). // d = number of allocated classrooms Q ? empty // Q: min-priority queue Initialize lastFin of every classroom to -1 (