Recall the load balancing problem where the goal is to minimize the makespan, the maximumload on any one machine. Now we have m slow machines and k fast machines. Each fastmachine perform twice as much work as a slow machine. Now we have n jobs with loadt1; t2; ; tn on the slow machines. Assign the jobs such that we minimize the maximum totalprocessing time on any machine. Design a polynomial algorithm that has a 3-approximationto the optimal solution.