Problem $2.$ Scheduling Processes with Different Ready Times: $42$ points

There are $7$ jobs to be processed, each with a different ready time, as shown in the table below. The processing times and due dates for each job are also provided. The ready time represents the time when each job arrives in the system. Apply the Shortest Processing Time $($SPT$)$ rule to determine the processing sequence of the jobs. In the event of a tie in processing times, use the Earliest Due Date $($EDD$)$ rule as a tiebreaker.

Q$2-1(10$ points$).$ What is the job processing sequence?

Q$2-2(6$ points$).$ How many jobs are in the queue at $10$:$27$AM$?$

Q$2-3(6$ points$).$ What is the mean Flow Time?

Q$2-4(6$ points$).$ What is the maximum Tardiness?

Q$2-5(6$ points$).$ How many tardy jobs are there?

Q$2-6(8$ points$).$ Among Jobs A to G$,$ which job experiences the longest waiting time? Based on this observation, can you comment on any disadvantages of using the SPT policy? Please explain briefly.