Answer Happy

Suppose you have 3 machines and 9 jobs, with the following
lengths:
5,1,5,5,6,4,2,4,5
Use Graham's algorithm to schedule the jobs and show the load
for each machine.
Machine 1:
Machine 2:
Machine 3:
What is the makespan?
Use the Longest Processing Time version of Graham's algorithm to
schedule the jobs and show the load for each machine.
Machine 1:
Machine 2:
Machine 3:
What is the makespan?
Find an optimal schedule (with a lower makespan than both of the
schedules previously created). If possible, write your answers
in descending order of the first job for each machine. If
not, I'll grade it manually.
Machine 1:
Machine 2:
Machine 3:
What is the makespan?
Can you explain the process, having difficulty with the last
quesiton