$(2$pt$)$ Scheduling of Aperiodic Real$-$Time Tasks with Starting Deadlines

Consider a set of $5$ aperiodic tasks with starting deadlines, see the exccution profiles of the following Table. Two "non$-$preemptive" scheduling algorithms were used.

What processes will miss the deadlines in each plocy?

FCFS $[$a$]$

Earliest deadline $[$b$]$

Table III. $7$ Execution Profile

$\backslash$table$[[$Process$,$Arrival Time,Execution Time,Starting Deadline$],[$A$,10,20,100],[$B$,20,20,30],[$C$,40,20,60],[$D$,50,20,80],[$E$,60,20,70]]$