Triathlon Competitor Scheduling You are trying to schedule triathlon contestants so that the triathlon completes as early in the day as possible. (The triathlon completes when all the contestants are done.) Each contestant has a projected swimming time, running time, and biking time. Since the pool is very small only one contestant can be in the pool at a time. Any number of contestants can be biking and running at the same time. The contestants first swim, then bike, and finally run. Assuming that each contestant will complete each event in their projected time, what is the best order to send the people out, if you want the whole competition to be over as soon as possible? That is, give and efficient algorithm that produces a schedule whose completion time is as early as possible. A. Specify an efficient greedy algorithm to achieve the goal of earliest completion of the competition. B. Prove your algorithm always finds the optimal solution. C. Analyze your algorithm's complexity.