3.6. Solve by branch-and-bound the following instance of the 1 | r; | Lmax problem. jobs 1 2 3 4 5 6 7 Pj Ti di 6 18 12 10 10 17 16 0 0 0 14 25 25 50 8 42 44 24 90 85 68 3.7. Consider the same problem as in the previous exercise. However, now the jobs are subject to the following precedence constraints. 2 + 1 + 4 6 + 7 Find the optimal sequence