Requests for solutions to billing$-$related IT problems have been received. Six of those jobs were assigned to Joel Williams, one of the support specialists. Joel has latitude in deciding the order in which these requests will be processed, but his performance is evaluated in terms of turnaround times or flow times. All jobs are equally important. Try the following rules: FCFS$,$ SPT$,$ EDD, and CR$.$ Requests will start being processed after the last one$$s arrival, that is$,68$ minutes.

Help Joel find the sequence that will minimize flow time based on the following data.

Help him find the sequence that will minimize tardiness

Request Arrival Time $($min$)$ Processing Time $($min$)$ Due Date

A $15100200$

B $25150300$

C $3080160$

D $35120250$

E $5030400$

F $6890350$