Use the critical path algorithm to create a priority list for the digraph below, then schedule the project with two processors.

T$1(8)$

T$2(5)$

T$3(8)$

T$4(12)$

T$5(10)$

T$6(5)$

T$7(7)$

T$8(10)$

T$9(3)$

End

$[$Graphs generated by this script: setBorder$(60,30,60,30)$;initPicture$(0,3,0,2)$; fontsize$=14$;fontstyle$=$'none';marker$=$"arrow";line$([0,2],[1,2])$;line$([0,2],[1,1])$;line$([0,1],[1,0])$;line$([0,0],[1,1])$;line$([1,2],[2,2])$;line$([1,2],[2,1])$;line$([1,1],[2,0])$;line$([1,0],[2,0])$;line$([2,2],[3,1])$;line$([2,1],[3,1])$;line$([2,0],[3,1])$;fontbackground$=$'white';fontfill$=$'blue';text$([0,2],\text{'}$T$1(8)\text{'},$'aboveleft'$)$;dot$([0,2])$;fontfill$=$'blue';text$([0,1],\text{'}$T$2(5)\text{'},$'belowleft'$)$;dot$([0,1])$;fontfill$=$'blue';text$([0,0],\text{'}$T$3(8)\text{'},$'belowleft'$)$;dot$([0,0])$;fontfill$=$'blue';text$([1,2],\text{'}$T$4(12)\text{'},$'aboveleft'$)$;dot$([1,2])$;fontfill$=$'blue';text$([1,1],\text{'}$T$5(10)\text{'},$'belowleft'$)$;dot$([1,1])$;fontfill$=$'blue';text$([1,0],\text{'}$T$6(5)\text{'},$'belowleft'$)$;dot$([1,0])$;fontfill$=$'blue';text$([2,2],\text{'}$T$7(7)\text{'},$'aboveright'$)$;dot$([2,2])$;fontfill$=$'blue';text$([2,1],\text{'}$T$8(10)\text{'},$'belowright'$)$;dot$([2,1])$;fontfill$=$'blue';text$([2,0],\text{'}$T$9(3)\text{'},$'belowright'$)$;dot$([2,0])$;fontfill$=$'blue';text$([3,1],$'End','belowright'$)$;dot$([3,1])$;$]$

Task $6$ is done by

Select an answer

starting at time

Task $9$ is done by

Select an answer

starting at time

The finishing time for the schedule is