The following table shows jobs to be processed at a machine. Determine the processing sequence that will minimize total number of late jobs.

Job Processing Time $($days$)$ Due Date $($days$)$

A $34$

B $25$

C $510$

D $211$

E $413$

F $920$

$1.$Job...

is the first job that is late in the given sequence.

$2.$ Job $....$

has the largest processing time out of these $5$ jobs.

$3.$ Optimal sequence is$................$

with one job late.