Use Lawler$$s algorithm to determine the schedule that minimizes maximum tardiness Tmax. $(10$ marks$)$

job i

$1$

$2$

$3$

$4$

$5$

$6$

$7$

pi

$12$

$7$

$10$

$3$

$9$

$4$

$5$

di

$68$

$12$

$38$

$45$

$42$

$7$

$11$

Precede by

$-$

$1$

$6$

$2$

$2$

$-$

$1$