Consider the following task set. Assume that Ts is the most functionally important task, followed by T2, and then by Task CT 1 6 T2 5 25 T3 30 100 a) What is the behavior of the scheduler if priority is based on functional importance? b) What is the processor utilization of the task set? Is the system overloaded? c) How should the task set be scheduled so that all deadlines are satisfied? d) Illustrate one priority-assignment scheme that allows the task set to be feasibly scheduled using a timeline. Consider the following task set. Assume that Ts is the most functionally important task, followed by T2, and then by Task CT 1 6 T2 5 25 T3 30 100 a) What is the behavior of the scheduler if priority is based on functional importance? b) What is the processor utilization of the task set? Is the system overloaded? c) How should the task set be scheduled so that all deadlines are satisfied? d) Illustrate one priority-assignment scheme that allows the task set to be feasibly scheduled using a timeline