Find a list that produces the optimal schedule; shown, when the list$-$processing algorithm is applied to this list. $($Assume that the tasks are independent$).$

What schedule is obtained when the decreasing$-$time$-$list algorithm is applied to this list?

Machine $1$: $T_1,T_2,T_3$

Machine $2$: $T_4,T_5,$ idle $28$ to $32$

Machine $1$: $T_4,T_2,T_1$

Machine $2$: $T_3,T_5,$ idle $28$ to $32$

Machine $1$: $T_2,T_4,T_5$

Machine $2$: $T_1,T_3,$ idle $26$ to $31$

Machine $1$: $T_1,T_4,T_1$

Machine $2$: $T_5,T_3,$ idle $22$ to $29$

What completion time is obtained when the decreasing$-$time$-$list algorithm is applied to this list? Give your answer as a whole number.

completion time: