3. Assume that there are n events where each takes one unit time. Event I will provide a profit of P[i] rupees is started at or before time T[il, 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 a.All events can start as early as time 0. Give an algorithm to find a schedule that maximizes the profit. 3. Assume that there are n events where each takes one unit time. Event I will provide a profit of P[i] rupees is started at or before time T[il, 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 a.All events can start as early as time 0. Give an algorithm to find a schedule that maximizes the profit