5. An important problem when dealing with operating systems is figuring out the best way to assign jobs to processors. Suppose we have a set of n execution times i,...jnJ, each corresponding to a different job, and we have m processors. Design an efficient algorithm that will schedule the jobs (as in assign each job to a processor) in a way such that the total time of the slowest processor to complete all jobs does not exceed twice the time of the optimal schedule. In other words, create an efficient 2-approximation job-scheduling algorithm Hint: For the analysis, consider the very last job that is scheduled 5. An important problem when dealing with operating systems is figuring out the best way to assign jobs to processors. Suppose we have a set of n execution times i,...jnJ, each corresponding to a different job, and we have m processors. Design an efficient algorithm that will schedule the jobs (as in assign each job to a processor) in a way such that the total time of the slowest processor to complete all jobs does not exceed twice the time of the optimal schedule. In other words, create an efficient 2-approximation job-scheduling algorithm Hint: For the analysis, consider the very last job that is scheduled