2.12. Consider 1 | sjk = ak + bj | Cmax. That is, job j has two parameters associated with it, namely aj and bj. If job j is followed by job k, there is a setup time sjk = ak + bj required before the start of job ks processing. The setup tim e of the first job in the sequence, s0k is ak, while the clean-up time at the completion of the last job in the sequence, sj0, is bj . Show that this problemis equivalent to 1 || Cmax and that the makespan therefore does not depend on the sequence. Find an expression for the makespan.