PLEASE EXPLAIN YOUR ANSWERS DETAILED AND SHOW EVERY STEP.

NEAT HANDWRITIG ONLY

THANK YOU

. (9 points) In computations over multiple processors, the load of a processor is sum of the times of all loads assigned to that processor. To balance the computation, the goal is to minimize the maximum load across the processors. For example, if the loads of three processors are 3, 10, 2 then the maximum load is 10. This assignment is less balanced (not as good) as one where the loads are 5,5,5 even though both assignments handle the same total load of 15. For this question, assume that the processors are labeled Pi, P2, Ps. The input to the load balancing problem is a list of jobs, each labeled by the time it would take to complete that job. The output of the problem is an assignment of a processor to each job. The greedy algorithm for load balancing goes through the list of jobs in the order given and assigns each job to the processor with smallest current load (if two processors have the same load, the algorithm chooses the one with smaller index; at the start of the algorithm, all processors have zero load). (a.) If the list of jobs is ji-4, J2 = 6, J3 = 7,34 = 8,Js = 5,Jo = 2, what jobs are assigned to each processor by the greedy algorithm? (b.) Is the greedy algorithm correct for this problem? Explain your answer. . (9 points) In computations over multiple processors, the load of a processor is sum of the times of all loads assigned to that processor. To balance the computation, the goal is to minimize the maximum load across the processors. For example, if the loads of three processors are 3, 10, 2 then the maximum load is 10. This assignment is less balanced (not as good) as one where the loads are 5,5,5 even though both assignments handle the same total load of 15. For this question, assume that the processors are labeled Pi, P2, Ps. The input to the load balancing problem is a list of jobs, each labeled by the time it would take to complete that job. The output of the problem is an assignment of a processor to each job. The greedy algorithm for load balancing goes through the list of jobs in the order given and assigns each job to the processor with smallest current load (if two processors have the same load, the algorithm chooses the one with smaller index; at the start of the algorithm, all processors have zero load). (a.) If the list of jobs is ji-4, J2 = 6, J3 = 7,34 = 8,Js = 5,Jo = 2, what jobs are assigned to each processor by the greedy algorithm? (b.) Is the greedy algorithm correct for this problem? Explain your