The following six jobs are to be scheduled on a single machine: (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Makespan: minutes Average flow time: minutes b. In what order would the jobs be processed using the SPT rule? The SPT sequence is Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time. The following six jobs are to be scheduled on a single machine: (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Makespan: minutes Average flow time: minutes b. In what order would the jobs be processed using the SPT rule? The SPT sequence is Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time