This problem studies dynamic$-$priority scheduling. Consider two tasks to be executed periodically on a single processor, where task $1$ has period p$1=4$ and task

$2$ has period p$2=6.$ Let the deadlines for each invocation of the tasks be the end

of their period. That is$,$ the first invocation of task $1$ has deadline $4,$ the second

invocation of task $1$ has deadline $8,$ and so on$.$