Seven jobs are to be processed through a single machine. The processing times and the due dates are given below: Job Processing time Due date 1 2 5 2 3 17 3 2 17 4 1 6 5 4 12 6 3 10 7 2 15 Furthermore, assume that the following precedence relationships must be satisfied: Job2 should be completed before Job1 can start. Job1 should be completed before Job6 can start. Job3 should be completed before Job4 can start. Job4 should be completed before Job6 can start. a) Find the sequence that minimizes the maximum tardiness, and compute maximum tardiness value that resulted from the sequence. (You are encouraged to use Gantt Chart for computations.) b) Now, consider the following situation: Precedence relations given above turns out to be more binding that you think. To be precise, these additional limitations require that you proceed with Job1 immediately after Job2, and similarly Job4 immediately after Job3. Also note that the due date for Job 2 and Job 3 is 17, and 17 is the sum of processing times. Now find the sequence that minimizes the maximum tardiness, and compute maximum tardiness value which results from the sequence. (You are encouraged to use Gantt Chart for computations.)