Suppose there are n jobs to be scheduled on a single processor. Job j requires tj time units to execute. All the jobs are to scheduled in timeW = ∑ jtj time units. Scheduling job j to start at time sj earns a profit (W - sj) pj. Design an optimal scheduling scheme. Assume that a job starts executing immediately after the previous scheduled job ends. The jobs have to be executed continuously, i. e. the jobs cannot be split.