Necessary and sufficient conditions for RM scheduling on a single processor and n tasks. mu = sigma c_i/p_i lessthanorequalto 1 mu = sigma c_i/p_i lessthanorequalto n (2^1 - 1) Do the Utilization Bound test for the above tasks. Check if the RM schedule ability is conclusive or inconclusive Show the schedule using Rate-Monotonic (RM) scheduling algorithm up to 25 time steps using the given table. How many preemptions happened? Indicate the location of the preemption. Is there any process missing its schedule? If yes, please indicate the process and the time when it happened. What is the Earliest Deadline First (EDF) algorithm? What are the differences from Rate-Monotonic (RM) scheduling algorithm? Show the schedule using Earliest Deadline First (EDF) algorithm up to 30 time steps (if processes are tied in deadline, no preemption will be invoked and the shorter period process goes first). Necessary and sufficient conditions for RM scheduling on a single processor and n tasks. mu = sigma c_i/p_i lessthanorequalto 1 mu = sigma c_i/p_i lessthanorequalto n (2^1 - 1) Do the Utilization Bound test for the above tasks. Check if the RM schedule ability is conclusive or inconclusive Show the schedule using Rate-Monotonic (RM) scheduling algorithm up to 25 time steps using the given table. How many preemptions happened? Indicate the location of the preemption. Is there any process missing its schedule? If yes, please indicate the process and the time when it happened. What is the Earliest Deadline First (EDF) algorithm? What are the differences from Rate-Monotonic (RM) scheduling algorithm? Show the schedule using Earliest Deadline First (EDF) algorithm up to 30 time steps (if processes are tied in deadline, no preemption will be invoked and the shorter period process goes first)