a) Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): At ADM's maintenance facility, following jobs (below) are ready for dispatching to a machine center. The processing times, date job received, and due dates for the jobs are given below. In what sequence would the jobs be ranked according to the decision rules on the left. The jobs are to be scheduled today, which is day 239 in ADM's manufacturing planning calendar days. Compute all times based on initiating (starting) work on day 239. Sequence Job 1 2 Job Due Date Date Job Received 234 231 228 225 230 K L M N o 4 Processing (days) 40 30 15 25 35 360 310 300 270 320 on The total flow time for the sequence developed using the SPT rule = days (round your response to two decimal places). The percentage utilization for the sequence developed using the SPT rule = % (enter your response as a percentage rounded to two decimal places). The average number of jobs in the system for the sequence developed using the SPT rule - jobs (round your response to two decimal places). The average tardiness (job lateness) for the sequence developed using the SPT rule=days (round your response to two decimal places). b) Using the LPT (longest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): Sequence Job 1 2 3 4 5 The total flow time for the sequence developed using the LPT rule = days (round your response to two decimal places). The percentage utilization for the sequence developed using the LPT rule = ]% (enter your response as a percentage rounded to two decimal places). The average number of jobs in the system for the sequence developed using the LPT rule = jobs (round your response to two decimal places). The average tardiness (job lateness) for the sequence developed using the LPT rule=days (round your response to two decimal places)