2. Minimum job completion time Suppose there are n distinct and independent jobs, labeled J1, J2, ..., Jn. Also, suppose

[answerhappygod]

2. Minimum job completion time Suppose there are n distinct andindependent jobs, labeled J1, J2, ..., Jn. Also, suppose there isone supercomputer and sufficient number of PCs (which is more thann). Each job consists of two stages: first it needs to bepreprocessed on the supercomputer, and then 1t needs to be finishedon one of the PCs. Job Ji needs Pi seconds of time on thesupercomputer, followed by fi seconds of time on a PC. Since wehave sufficient PCs, the finishing of the jobs can be performedfully in parallel - all the jobs can be processed at the same timeon different PCs. However, the supercomputer can only work on asingle job at a time. A schedule is an ordering of the jobs for thesupercomputer, and the completion time of the schedule is theearliest time at which all jobs will have finished processing onthe PCs. Give a polynomial-time greedy algorithm that finds aschedule with the minimum completion time.