Assume that there are n events where each takes one unit time. Event I will provide a profit of P[i] dollars is started at or before time T[i], where T[i] is an arbitrary number. If an event is not started at T[i] then there is no benefit in scheduling it at all. All events can start as early as time 0. Give an algorithm to find a schedule that maximizes the profit.