3. Consider the following periodic tasks , with deadline equal to period ?

(a) Calculate the CPU utilization for this set of tasks. Based on utilization, is it guaranteed to be schedulable with earliest deadline first scheduling? Is it guaranteed to be schedulable with rate monotonic scheduling? Is it possible for it to be schedulable with rate monotonic scheduling (based only on utilization)?

(b) Draw a chart like the one on the lecture slides, showing the arrival time and computation time of each periodic task, and the schedule of execution according to EDF and RMS.

3. Consider the following periodic tasks , with deadline equal to period ?Task Computation time PeriodI]In( a ) Calculate the CFU utilization for this set at tasks . Based on utilization , is it guaranteed to beschedulable with earliest deadline first scheduling*!" Is it guaranteed to be schedulable with ratemonotonic scheduling" Is it possible for it to he schedulable with rate monotonic scheduling ( basedonly on utilization! "