You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time–that...

Give me answer fast.

Extracted text: You're helping to organize a mini-triathlon event: each of n contestants must first swim 20 laps of a pool, then bike 10 miles, then run 3 miles. The contestants must use the pool one at a time–that is, as soon as the first persom is out of the pool, a second contestant can begin swimming the 20 laps-but many contestants may bike and run simultaneously. For each contestant i, you know the expected swimming time Si, expected biking time b; and expected running time r;. Assume that all contestants need exactly their expected times to finish the three parts of the triathlon. You are tasked with sequencing the starts of the contestants so that the triathlon event ends as soon as possible. More formally, a schedule for the triathlon is an order in which to sequence the starts of the contestants. The completion time of a schedule is the earliest time at which all contestants will be finished. Given n triples (si, b;, r;), design an efficient algorithm that produces the schedule with the minimum completion time.