QUESTION TWO a. Describe an allocation of resources that yields an unsafe yet not deadlocked state. Show why it is not guaranteed that deadlock will occur. [4 marks) b. Describe how deadlock prevention works by denying some of the necessary conditions of a deadlock. [6 marks] ci. Under what conditions does round robin scheduling perform poorly compared to FIFO? [3 marks) ti. In the situation you described in part (ci) above, does reducing the time slice for round-robin scheduling help or hurtits performance relative to FIFO? Why? [3 marks) d. Distinguish between a heavyweight process and a multi-threaded process by showing their address space. Briefly explain the difference(s) a marks) c. Write linux programming code for the following: Given a file name "udent list that contais tudnames with their respective grade remarks in OST counte, which could either was "Failed 1. Acoming makeup exam was conducted and all the student eventually ped. Thanks to Dr. Olafor's pricele explanation update all the student remarks to "Ped" Smarta