Question $4.$ A system containing the following three independent and preemptable periodic

tasks is scheduled according to the structured clock$-$driven scheduling algorithm:

$T1=(3,1),T2=(6,2),T3=(12,2)$

a$)[10$pts$]$ Construct the schedule of the first major cycle.

b$)[10$pts$]$ An aperiodic task A with execution time $4\mathrm{.}5$ arrives at $1\mathrm{.}5.$ Schedule $A$ at the

slack time intervals of the schedule produced in $($a$).$

c$)[10$pts$]$ Reschedule A with slack stealing based on the schedule produced in $($a$).$