3 You Can't Pause Toast Leon needs to make breakfast toast for the n members of his family. His toaster can accommodate one person's toast at a time, and each family member, i, wants their toast to spend ti seconds in the toaster. In Leon's household, certain family members must have their toast before others (the precedence relationships form a directed acyclic graph). Violating precedence constraints is not an option, as it will make everything topsy turvy. Also, the amount of complaining that will be voiced by family member, j, if they receive their toast at time t is ci (t), where c is a member-specific, non-negative, strictly increasing function. One thing Leon has learned is that you cannot pause toast. Pausing toast causes it to lose its essence. So, once Leon starts toasting someone's toast, he cannot stop until it is done. Now, truth be told, Leon doesnot want to bring the ruckus to this breakfast. He asks you to develop a greedy algorithm that finds the ordering (schedule) that minimizes Hint: start at the end the maximum complaining among all valid toast schedules