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

Schedule the 7 tasks on 3 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 :

Time savings =