2) Consider a scheduling problem for two uniform parallel machines. There are 6 jobs to be processed and the processing are as follows: Job 1 2 3 4 5 6 Process time 4 6 10 8 10 14 Speeds of machines are 2 and 1 for Machines 1 and 2, respectively. Use the algorithm discussed in lecture to minimize the maximum completion time of jobs. Draw Gantt charts for the schedule. 2) Consider a scheduling problem for two uniform parallel machines. There are 6 jobs to be processed and the processing are as follows: Job 1 2 3 4 5 6 Process time 4 6 10 8 10 14 Speeds of machines are 2 and 1 for Machines 1 and 2, respectively. Use the algorithm discussed in lecture to minimize the maximum completion time of jobs. Draw Gantt charts for the schedule