This problem deals with load balancing. The input to the problem is a collection of p processors and n jobs, t, is the time required to run job j, jobs run without interruption on a single machine until finished, and a processor can run only one job at a time. The load Lk of processor k is the sum over all jobs assigned to processor k of the times required to run these jobs. The makespan is the maximum load over all the p processors. This load balancing problem asks for an assignment of jobs to processors to minimize the makespan (a) Suppose we have three processors and five jobs requiring times t1 = 3, t2 = 5, t3 = 4, 4 = 7, and ts-8. Solve the load balancing problem for this input by finding the assignment of the five jobs to the three processors that minimizes the makespan. (b) Write out in pseudocode the greedy algorithm that goes through the jobs in order and assigns each job to the processor with the smallest load at that point in the algorithm