Consider the order-requirement digraph above (where all indicated weights are in minutes) and the priority list T5,T3,T1,T4,T2,T6. Using the list-processing algorithm, the 6 tasks may be completed on 3 processors in a time of 20. If instead 4 processors are used, how much time (if any) is saved?

Schedule the 6 tasks on 4 processors. Enter the task labels and idle times (if any) in order for each processor, separated by commas. For example: 3,T1,T2,4,T5,6

Processor 1 :
Processor 2 :
Processor 3 :
Processor 4 :

Time savings =