Problem $22-13($Algo$)$

Jobs A$,$ B$,$ C$,$ D$,$ and E must go through Processes I and II in that sequence $($Process I first, then Process II$).$

$\backslash$table$[[,$REQUIRED,REQUIRED$],[$PROCESSING$,$PROCESSING,$],[$JOB$,$TIME ON I,TIME ON II$],[$A$,7,5],[$B$,15,16],[$C$,6,8],[$D$,10,14],[$E$,4,9]]$

Use Johnson's rule to determine the optimal sequence in which to schedule the jobs to minimize the total required time.

$\backslash$table$[[$Job$,$Position in Sequence$],[$A$,],[$B$,],[$C$,],[$D$,],[$E$,]]$