Five jobs must be scheduled for batch processing on a highperformance computing system $($processing one job at a time$).$ The processing times and the promised times for the jobs are listed below. Assume that the current time is $10$:$00$ AM$.$ Job $12345$ Processing Time $30$ min $1\mathrm{.}5$ hr $48$ min $4$ hr $2\mathrm{.}5$ hr Promised Time $11$:$00$ AM $1$:$30$ PM $2$:$00$ PM $1$:$00$ PM $3$:$00$ PM $($a$)$ If the jobs are scheduled according to SPT$,$ find the tardiness of each job and the mean tardiness of all jobs $($hint: you may convert the processing and due time first$).($b$)$ Repeat the calculation in part $($a$)$ for EDD scheduling. $2.($P$671$ P$10$ numbers tweaked$)$ Seven jobs are to be processed through a single machine. The processing times and due dates are given below. Determine the sequence of the jobs in order to minimize $($a$)$ mean flow time $($hint: SPT$)($b$)$ number of tardy jobs $($hint: Moore$$s algorithm$)($c$)$ maximum lateness $($hint: EDD or Lawler$$s algorithm without precedence constraints$).$ Job $1234567$ Processing Time $3684217$ Due Date $48161011232$