$(32$ points$)$ Consider three periodic tasks $A,B$ and $C$ with their respective periods as

$4ms,6ms$ and $8ms.$ The execution time required for each task is $1ms.$

$($a$)$ Draw a figure$/$table to execute these periodic tasks on a uniprocessor according to

$CE,$ with frame size $4.$ Show steps on how the table is formed with Max Flow.

$($b$)$ Two aperiodic jobs are released at time $7$ and $9,$ with execution requirements of $3$ and $1.$

Draw a figure$/$table to execute these periodic tasks on a uniprocessor according to CE with

slack stealing.

$($c$)$ Will the two jobs in $($b$)$ be accepted if they both have deadlines at time $15?$ If so$,$ draw

the schedule. If not, state why $($w$.$r$.$t$.$ admission control conditions$).$

$($d$)$ What is the latest "feasible" release time for the first job in $($b$)$ to accepted into the

system with a deadline at time $15?$