Question A (15 points): 3 periodic tasks Ti, T2, T3 and 2 re for these tasks such that there exists an execution scenario that results in priority inversion, and also there exists an execution scenario that result in deadlock when priority inheritance protocol is used. (There is no need that answers to all the parts be based on the same example scenario). 1. Show the execution scenario that leads to priority inversion 2. Show the execution scenario using Priority Inheritance Protocol that leads to deadlock 3. Show the execution sequence using Priority Ceiling Protocol for the above deadlocked scenario. Reading material for Questions A, B, and C (optional): L. Sha, R. Rajkumar, and S.S. Sathaye, "Generalized rate-monotonic scheduling theory: A framework for developing real-time systems," Proc. IEEE, vol.82, no.1, pp.68-82,Jan. 1994