Currently a company that designs Web sites has five customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. The customers are ready to be scheduled today, which is the start of day $190.$

$\backslash$table$[[$Customer$,\backslash$table$[[$Time Since$],[$Order Arrived$],[($days ago$)]],\backslash$table$[[$Processing$],[$Time $($days$)]],\backslash$table$[[$Due Date$],[($days from$],[$now$)]]],[$A$,3,24,58],[$B$,2,32,100],[$C$,10,20,26],[$D$,8,12,50],[$E$,6,28,66]]$

a$.$ Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due.

Using the FCFS $($first come, first served$)$ decision rule for sequencing the customers, the order is:

$\backslash$table$[[$Sequence$,1,2,3,4,5],[$Customer$,$grad,grad,grad,grad,$\frac{?}{\text{b}\text{a}\text{r}}(grad)$