Consider seven tasks, A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ and G$,$ with precedence relations among them as: $AC,BC,BD,CE,CF,DF,DG$ where $xy$ implies $y$ can start its execution only after the completion of $x\text{'}$s execution. The task graph representing this precedence relation is given below.

Assume that all tasks have arrived at $t=0,$ have deadlines $d=25,$ and their computation times are $2,3,3,5,1,2,5$ respectively. Modify the deadlines of the tasks similar to EDF$*.$ Consider that the new release time of a task can be replaced by the maximum between the finishing time of its immediate predecessors and the release time of that task. With the modified release times and deadlines, construct the EDF schedule. Assume that period of each task is same as its deadline.

a$.B,A,D,C,E,F,G$

b$.A,B,D,C,E,F,G$

c$.B,A,C,D,E,F,G$

d$.A,B,C,D,E,F,G$

a$.$

b$.$

C$.$

d$.$