Please help me with my operations research homework make sure it's thoughtougly done $,$ sure the working mostly must be clear and easy to understand

$($lecture $10)$ Consider one$-$machine scheduling problem to minimize the total number of tardy jobs with the following data.

$\backslash$table$[[$Job$,1,2,3,4,5,6],[\backslash$table$[[$Processing$],[$time$]],12,12,7,2,3,4],[$Due date,$13,17,15,10,16,13]]$

$($a$)$ What is the optimal scheduling policy and its corresponding number of tardy jobs?

$($b$)$ Please consider the shortest processing time $($SPT$)$ first policy. What is the scheduling policy and its corresponding number of tardy jobs?

$($c$)$ Please consider the earliest due date $($EDD$)$ first policy. What is the scheduling policy and its corresponding number of tardy jobs?

$($d$)$ Please consider the first$-$come$-$first$-$served $($FCFS$)$ policy. What is the scheduling policy and its corresponding number of tardy jobs?

$($e$)$ Please compare the number of tardy jobs for the above $4$ policies.

$2.($lecture $10)$ Consider section $10\mathrm{.}2\mathrm{.}1.$

$($a$)$ If the second job is an urgent order and needs to be processed first, what are its corresponding constraints for this additional constraint?

$($b$)$ Please consider the dataset in the first individual problem. If the second job is the first job to be processed, what is the optimal scheduling policy and its corresponding number of tardy jobs?

$($c$)$ Please compare the result of $2($b$)$ with $1($a$).$ What is your conclusion or observation?