I know that with Chegg guidelines only 1 problem can be answered per post (but multiple parts to a question may be answered) but I am looking for help on number 2! I already solved 1, unless someone would like to do them both.

Sequencing (SPT) Number of Jobs 5 Job Sequence 1 1 2 Processing Time 8 3 5 2 10 Job 4 2 3 Due Date 13 19 9 8 17 2 3 4 5 Processing Time Due Date Flow Time Lateness Tardiness 2 8 3 19 5 9 8 13 10 17 4 1 LO 5 Average Sequencing (EDD) Number of Jobs 01 Job Sequence Job 4 1 1 2 3 2 3 4 Processing Time 8 3 5 2 10 Due Date 13 19 9 8 17 Processing Time Due Date Flow Time Lateness Tardiness 2 8 5 9 8 13 10 17 19 4 5 5 2 5 Average 1. Use the shortest-processing-time (SPT) sequencing rules to sequence the jobs. Compute the flow time, tardiness, and lateness for each job, and the average flow time, average tardiness, and average lateness for all jobs. Use minus sign to enter negative lateness values, if any. Round the average values to two decimal places. Sequence Job Processing Time Due Date Flow Time Lateness Tardiness 4 1 2 8 2 2 3 19 3 3 5 9 4 8 13 1 5 5 10 17 Average 2. Use the earliest-due-date (EDD) sequencing rules to sequence the jobs. Compute the flow time, tardiness, and lateness for each job, and the average flow time, average tardiness, and average lateness for all jobs. Use minus sign to enter negative lateness values, if any. Round the average values to two decimal places. Sequence Job Due Date Flow Time Lateness Processing Time 2 Tardiness 1 4 8 2 3 5 9 3 1 8 13 4 5 10 17 5 2 3 19 Average