1. In this question we consider a variation of the scheduling problem in which we are given n distinct jobs /i each of which can be completed independently. Each job has two stages to be completed. The first stage of each job is the bottleneck in the sense that there is only one resource that can handle it and for job j, takes f; time. The second stage is less complicated and can be completed in parallel witlh other jobs as there are many resources available to complete this portion of the job. We will denote the time required to complete stage 2 of job ji as si For example, consider a factory where there is a unique machine that must be used in the production of each product before it can go through the final stages with an employee. Assume that there are enough employees (i.e., n employees) to handle the second stage of all the jobs at the same time. Give a polynomial-time algorithm to return a schedule that orders the jobs for stage 1 so that the completion time of stage 2 for all the jobs is minimized (ie, the total time for all jobs to be completed is minimized). Prove your algorithm is correct and explain it's complexity