A set of ten jobs are processed in a two$-$machine workshop. The technological order and the unit processing times of the works are given below. Using the Jackson algorithm, determine the schedule that minimizes Cmax and show it on the Gantt diagram. Calculate machine idle times for each machine. $(20$p$)$

$\backslash$table$[[,$Machine Order,Processing Time$],[$Tasks$,$Operation $1,$Operation $2,$Operation $1,$Operation $2],[1,M_1,M_2,4,6],[2,M_1,-,3,-],[3,M_1,-,4,-],[4,M_1,M_2,5,2],[5,M_2,M_1,1,2],[6,M_2,,1,-],[7,M_2,M_1,7,8],[8,M_2,-,3,-],[9,M_2,M_1,6,7],[10,M_1,M_2,2,4]]$