Design a greedy algorithm running in O(nlogn) time to compute the problem.

Input: A set of n task a1, a2, ..., an each expressed as ai = (n, di) where is the release time, and d, the time duration. I All the tasks are executed by a single CPU without a time overlap after the time r taking duration time di Output: Minimum finish time of the last executed task The difference from the original problem is a (release time, duration) changed from (start time, finish time): Each task a, is released at the time , after which the CPU can execute it anytime taking duration d. So the CPU can finish all the tasks anyway. Now you don't maximize the number of executed tasks, but find a schedule with the earliest time to finish all