3.6. Solve by branch-and-bound the following instance of the 1 | rj | Lmax problem. jobs 1 2 3 4 5 6 7 6 18 12 10 10 17 16 0 14 25 25 50 8 42 44 24 90 85 68 Pj rj d;