2. If the list-processing algorithm is applied to the accompanying order-requirement digraph (task time in minutes) using the list T₁, T₂, T₃, T₄, and three machines are available, the earliest completion time for all the tasks is ______________.