1. ( 30 points) Consider the 1 | prec Pmax problem where the objective of a company is to minimize the maximum penalty (Pmax) paid due to late jobs. There are 7 jobs to be completed. There are some precedence relations on the sequence of jobs. J1 and J4 must be completed before J5 starts. J3 is an immediate follower of J2. Determine the optimal job sequence and the resulting penalty. Show all your steps explicitly. Please select a different integer processing time for each of the jobs from the common interval [10,20]& select a different integer due date for each of the jobs from the common interval [15,50]. Before solving the question, write the selected processing time and due date of the jobs in the answer sheet. 1. ( 30 points) Consider the 1 | prec Pmax problem where the objective of a company is to minimize the maximum penalty (Pmax) paid due to late jobs. There are 7 jobs to be completed. There are some precedence relations on the sequence of jobs. J1 and J4 must be completed before J5 starts. J3 is an immediate follower of J2. Determine the optimal job sequence and the resulting penalty. Show all your steps explicitly. Please select a different integer processing time for each of the jobs from the common interval [10,20]& select a different integer due date for each of the jobs from the common interval [15,50]. Before solving the question, write the selected processing time and due date of the jobs in the answer sheet