$4.(4$ pts$)$ A service center has $5$ jobs to process when it opens. The estimated service times in minutes are $(35,20,27,30,45),$ in order of arrival. The deadlines are $(130,60,90,75,120).$

$($a$)(1$ pt$)$ What are the total flowtime, total lateness, and total tardiness, using FIFO?

$($b$)(1$ pt$)$ What are the total flowtime, total lateness, and total tardiness, using SPT$?$

$($c$)(1$ pt$)$ What are the total flowtime, total lateness and total tardiness, using EDD?

$($d$)(0\mathrm{.}5$ pts$)$ Compare the total flow time, max tardiness, and the number of tardy jobs across the three dispatching rules. Which dispatching rule has the minimum total flow time, which has the minimum max tardiness, and which has the minimum number of tardy jobs?

$($e$)(0\mathrm{.}5$ pts$)$ Start with the EDD sequence. Which two adjacent jobs can you interchange to improve the total flow time without increasing the maximum tardiness?