Consider the order-requirement digraph above, where all indicated weights are in minutes. For the priority list T3,T4,T2,T6,T5,T1, use the list-processing algorithm to schedule the 6 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 :

Total processing time (minutes) :

You can earn partial credit on this problem.