3. (Class 3) We have the following set of jobs to be processed on a single machine. There are precedence constraints amongst them and the immediate predecessor is given. Job Processing Time Due Date Immediate Predecessor(s) A 12 15 B C D E F G H 6 6 2 2 12 7 1 16 14 18 20 37 45 A B B B B C D E 40 (a) [5 points) Draw out the predecessor network based on the immediate predecessors. Which jobs are eligible to be the last one finished? Which jobs are eligible to be the first one started? (b) [25 points] Apply Lawler's algorithm to the problem of minimizing the max- imum tardiness. As you build back your schedule, please provide the current 'completion time of the set of remaining jobs at each step