We have n jobs to schedule. The jobs take durations {C}1 each, to complete. Also, each job has an associated penalty {Li}. If a job i is completed at a time t, the total penalty can be calculated as P = Lieti (this is called exponential penalty). We can perform only one job at a time. Find an algorithm to schedule the jobs so that the total penalty is minimized. i=1