Problem 3. An embedded application has three tasks with task execution times and periods as shown in table 3.1. Task Execution Time Period task 1 task 2 task 3 1 ms 2 ms 3 ms 0.4 ms 1.2 ms Table 3.1. Task data for Problem 3. We would like to design a cooperative time-slice scheduler which will run these tasks. In answering the following, assume the tasks are not interrupted and execute in the order shown in table 3.1 (a) What is the processor load for these 3 tasks? (b) For these 3 tasks the maximum length time-slice in a cooperative time-slice scheduler is 1 ms. What is the minimum length time-slice required for the tasks listed in table 3.1? ime-slice we can considler subtasks and using mutual exclusion. For a 1 ms time-slice which task should be partitioned and what is the range of acceptable execution times for each of the subtasks? hyperperiod. ms) for task 27 (d) For the two tasks and the subtasks found in (c) sketch the program context over one 6 ms (e) For the cooperative time-slice scheduler implemented in (d) what is the worse case latency (in Problem 3. An embedded application has three tasks with task execution times and periods as shown in table 3.1. Task Execution Time Period task 1 task 2 task 3 1 ms 2 ms 3 ms 0.4 ms 1.2 ms Table 3.1. Task data for Problem 3. We would like to design a cooperative time-slice scheduler which will run these tasks. In answering the following, assume the tasks are not interrupted and execute in the order shown in table 3.1 (a) What is the processor load for these 3 tasks? (b) For these 3 tasks the maximum length time-slice in a cooperative time-slice scheduler is 1 ms. What is the minimum length time-slice required for the tasks listed in table 3.1? ime-slice we can considler subtasks and using mutual exclusion. For a 1 ms time-slice which task should be partitioned and what is the range of acceptable execution times for each of the subtasks? hyperperiod. ms) for task 27 (d) For the two tasks and the subtasks found in (c) sketch the program context over one 6 ms (e) For the cooperative time-slice scheduler implemented in (d) what is the worse case latency (in