Using the information from Problem 1, and assuming that all of the automobiles arrived at the same time, use a Gantt chart and the shortest-process-time (SPT) rule to prioritize the jobs. Determine the due dates, the makespan , average flowtime , and average queue time. Assume that transfer times are zero. For ties, process the job with the lowest first repair center processing time first.