$1.$ Suppose we use the earliest due date $($EDD$)$ algorithm to schedule three jobs $($recall that each job has a deadline and a processing time$).$ Assume that the EDD algorithm produces the schedule Job $1,$ then Job $2,$ then Job $3.$ If we use this EDD schedule and Job $2$ is late, then Job $3$ is also late $(2$ marks$).$

$2.$ Suppose a project has $10$ activities $($Activity A to J$).$ The path A$,$ B$,$ C$,$ D$,$ F$,$ J is $120$ days, the path of A$,$ B$,$ C$,$ D$,$ E$,$ J is $150$ days and Path A $,$B$,$ C$,$ D$,$ G$,$ J is $135$ days. If the activity E is crashed by $20$ days, then the overall duration of the project will decrease by $20$ days. $(2$ marks$)$

$3.$ Suppose a project has four critical activities. The project manager only needs to crash one critical activity to reduce the overall duration of the project $(2$ marks$).$