Consider $1|$ chains $|$

wjCj with the same set of jobs as in Exercise

$3\mathrm{.}1.($a$).$ The jobs are now subject to precedence constraints which take the form

of chains:

$1->2$

$3->4->5$

$6->7$

Find all optimal seque