$($Alice$$s Alterations$)$: Alice$$s Alterations has eight jobs to be completed and only one sewing machine $($and one sewing machine operator$).$The following jobs are waiting to be scheduled for the sewing machine. The letter of the alphabet indicates the sequence in which the jobs arrived.$$It is now the beginning of Day $5.$

Job $$Processing Time $($in days$)$Promised Time $($days$)$

A $510$

B $815$

C $615$

D $320$

E $1025$

F $1440$

G $745$

H $350$

$($a$)-$Prioritize these jobs by SPT $($shortest processing time$)$ and EDD $($Earliest Due Date$)$ Schedules.

$($b$)-$ Prioritize these jobs by FCFS $($First Come First Serve$)$ and Moore$$s Algorithm.

$($c$)-$Evaluate your above four priority sequences on average flow time, average lateness, and number of jobs late.

$($d$)-$Based on your analysis in $($c$),$ what sequencing scheme would you select?$$Why$?$