1a. A programming specialist has contracted five programming jobs. Certain of these jobs must follow a sequence because the associated modules are linked to one another. The precedence constraints among the jobs that must be obeyed are shown below. The table below has the job numbers, their required processing times, and their due dates (assume jobs are due by the end of the day given). Assume it is the beginning of the day on September 1 and she will start work right away. Assuming the programmer never takes a day off, use Lawler's algorithm to find the sequence she should use to minimize maximum lateness while obeying the precedence constraints. First job in sequence: Second job in sequence: Third job in sequence: Fourth job in sequence: Fifth job in sequence: What is the minimum value of maximum lateness achieved by the schedule? days