2. A workshop uses a single machine to process three jobs. Both the processing time and the due date (in days) for each job are given in the following table. The due dates are measured from zero, the assumed start time of the first job. Job Processing time (day) Due date (day) Late penalty (S/day) 15 25 19 2 20 12 3 35 34 The objective of the problem is to determine the job sequence that minimizes the late penalty for processing all three jobs. 22 15