Problem $2.$ Scheduling Processes with Different Ready Times $(40$ points$)$

There are $8$ 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 provided. The ready time represents the time when each job arrives in the system. Apply the Last In$,$ First Out $($LIFO$)$ rule to determine the processing sequence of the jobs. In the event of a tie in arrival times, use the Shortest Processing Time $($SPT$)$ rule as a tiebreaker.

$\backslash$table$[[$Job$,\backslash$table$[[$Ready$],[($Arrival$)$ Time$]],\backslash$table$[[$Processing$],[$Time $($Mins$)]],$Due Date,$\backslash$table$[[$Completion$],[$time$]],\backslash$table$[[$Waiting$],[$Time$]],\backslash$table$[[$Flow$],[$Time$]],$Lateness,Tardiness$],[$A$,6$:$00AM,11$ mins,$6$:$20AM,,,,,],[$B$,6$:$03AM,7$ mins,$6$:$30AM,,,,,],[$C$,6$:$10AM,8$ mins,$6$:$25AM,,,,,],[$D$,6$:$03AM,8$ mins,$6$:$35AM,,,,,],[$E$,6$:$20AM,5$ mins,$6$:$40AM,,,,,],[$F$,6$:$42AM,9$ mins,$7$:$05AM,,,,,],[$G$,6$:$45AM,15$ mins,$7$:$00AM,,,,,],[$H$,6$:$42AM,7$ mins,$7$:$00AM,,,,,]]$

Q$2-1(6$ points$).$ What is the job processing sequence based on the LIFO rule with SPT as the tiebreaker?

Q$2-2(4$ points$).$ What is the Mean Flow Time $(\frac{?}{\text{b}\text{a}\text{r}}(F))$ for all jobs processed?

Q$2-3(4$ points$).$ What is the Average Waiting Time?

Q$2-4(4$ points$).$ What is the number of tardy jobs?

Q$2-5(8$ points$).$ What is the average queue length in the system between $6$:$00$AM and $7$:$20$AM under this strategy?

Q$2-6(8$ points$).$ What is the average number of jobs $($items$)$ between $6$:$00$AM and $7$:$20$AM under this strategy? Q$2-7(6$ points$).$ What is the utilization of the system between $6$:$00$AM and $7$:$20$AM under this strategy?