Six jobs are to be processed through a three$-$step operation. The first operation involves s$],[$involves painting, the third involves finishing. Processing times are as follows:$]]],[$Job$,$Operation $1($hours$),$Operation $2($hours$),\backslash$table$[[$Operation $3],[($hours$)]]],[$A$,10,5,6],[$B$,7,4,4],[C,5,-1,6],[$D$,3,8,6],[$E$,2,6,2],[$F$,4,0,8]]$

Determine a sequence that will minimize the total completion time for these jobs. Illustrate graphically.