Question B (10 points): Consider three dependent tasks T1 ,T2, and T3. The tasks T2 and T3 have access to a shared resource R. In order to describe this task set with the critical sections of task T1 and T3, we add new parameters that specify the computation time ci as follows: c: task duration before entering the critical section, CY: critical section duration, c: task duration after the critical section. Of course, we have c; =C + c ; +. So the task set is described by the parameters given in the following table. As we know, each task in a critical section can be preempted by a higher priority task which does not need this resource. Task (T) (ci picici T ciz T1 416 4 0 0 0 T3 8 T 24T0 8 0 I Answer the following: 1. Construct the schedule obtained under the RMS algorithm. Indicate at what point priority inversion occurs. 2. In order to prevent this priority inversion, apply priority inheritance protocol. Construct the schedule obtained using RMS algorithm with priority inheritance protocol enabled