Given the order-requirement digraph above (with the time given in minutes) and the priority list T5,T3,T4,T2,T6,T1, apply the list-processing algorithm to schedule the 6 tasks on two 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 :

How much time does the resulting schedule require?

Time required (minutes) :