In the "Interval Scheduling" Problem, there is a single resource and many requests in the form of time intervals, so we must choose which requests to accept and which to reject.

In the "Scheduling all Intervals" Problem, a related problem arises if we have many identical resources available and we wish to schedule all the requests using as few resources as possible. Because the goal here is to partition all intervals across multiple resources.

Provide a counter-example to show that the earliest finish time first leads to a non-optimal solution for the Scheduling All Intervals problem